A lazy evaluator

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130832, Issue , 1976, Pages 95-103

  Henderson, Peter ^a   Morris, James H ^b  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

EVALUATION OF PARAMETERS; LIST STRUCTURES; PARTIAL CORRECTNESS PROOFS;

LISP (PROGRAMMING LANGUAGE);

EID: 85026614543     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800168.811542     Document Type: Conference Paper

References (7)

1. Curry. H. B. and Feys. R., Combinatory Logic, vol I. North-Holland, 1958.
2. Hewitt, Carl, et. al., Behavioral semantics of nonrecursive control structures, Proceedings, Colloque sur la Programmation, Springer-Verlag Lecture Notes in Computer Science, No. 19, 1974.
3. Reynolds, J. R., Notes on a lattice-theoretic approach to the theory of computation, Lecture notes, Syracuse Unversity, 1971.
4. Scott, D. and Strachey, C, Toward a mathematical semantics for computer languages, Proc. of the Symposium on Computers and Automata, Polytechnic Institute of Brooklyn, and PRG-6 Oxford University Computing Laboratory, 1971
5. Stoy, J., The Scott-Strachey approach to the mathematical semantics of programming languages, Course notes at M. I. T. Project MAC, 1973.
6. Vuillemin, J., Correct and optimal implementations of recursion in a simple programming language, Journal of Computer and System Sciences, vol. 9, No. 3, December 1974.
7. Wadsworth, Christopher, Semantics and Pragmatics of the Lambda-calculus, PhD. thesis, Oxford, 1971