REFERENCE COUNTING CAN MANAGE THE CIRCULAR ENVIRONMENTS OF MUTAL RECURSION

被引：20
作者：
FRIEDMAN, DP
WISE, DS
机构：
[1] Computer Science Department, Indiana University, Bloomington
来源：
INFORMATION PROCESSING LETTERS | 1979年 / 8卷 / 01期
基金：
美国国家科学基金会;
关键词：
applicative programming; closure; funarg; ISWIM; lexical scoping; LISP; Storage management; threads; Y-combinator;
D O I：
10.1016/0020-0190(79)90091-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：41 / 45
页数：5
相关论文
共 21 条
[1]  
Baker, List processing in real time on a serial computer, CACM, 21, 4, pp. 280-294, (1978)
[2]  
Burge, Recursive Programming Techniques, (1975)
[3]  
Collins, A method for overlapping and erasure of lists, Communications of the ACM, 3, 12, pp. 655-657, (1960)
[4]  
Curry, Feys, Combinatory Logic, 1, (1958)
[5]  
Friedman, Wise, Aspects of applicative programming for file systems, Proc. ACM Conf. on Language Design for Reliable Software, 12, 3, pp. 41-55, (1977)
[6]  
Friedman, Wise, Functional combination, J. Comput. Languages, 3, 1, pp. 31-35, (1978)
[7]  
Friedman, Wise, Aspects of applicative programming for parallel processing, IEEE Transactions on Computers, 100-127, 4, pp. 289-296, (1978)
[8]  
Gries, An exercise in proving parallel programs correct, Communications of the ACM, 20, 12, pp. 921-930, (1977)
[9]  
Hewitt, Smith, Towards a programming apprentice, IEEE Transactions on Software Engineering, 1 SE, 1, pp. 26-45, (1975)
[10]  
Ingalls, The Smaltalk-76 programming system, Proc. 5th ACM Symp. on Principles of Programming Languages, pp. 9-16, (1978)
123