Recursive definitions of partial functions and their computations
Recursive definitions of partial functions and their computations
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Clauses: scope structures and defined functions in Lucid
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Threshold evaluation and the semantics of call by value, assignment and generic procedures
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Semantics and axiomatics of a simple recursive language.
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Bases for chain-complete posets
IBM Journal of Research and Development
Program equivalence and context-free grammars
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming language, where the only mean of iteration is through recursion. The theory of computation developped in Scott [4] provides the framework of our study. We show how the implementations of recursion which deserve to be called “correct” can be characterized semantically, and demonstrate a general criterion for the correctness of an implementation. We then describe an implementation of recursion which is both correct and optimal in a general class of sequential languages, and therefore constitutes an attractive alternative to both “call-by-name” and “call-by-value”.