Fixpoint approach to the theory of computation
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
A Discipline of Programming
Semantics and axiomatics of a simple recursive language.
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A formal approach to the study of parameter passing mechanisms and non-determinism.
A formal approach to the study of parameter passing mechanisms and non-determinism.
An indeterminate constructor for applicative programming
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nondeterministic call by need is neither lazy nor by name
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A deconstruction of non-deterministic classical cut elimination
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
| Hi-index | 0.00 |
The problem of defining an adequate semantics for recursive definitions which allow various types of parameter-passing mechanisms has generated a considerable amount of interest in the literature. (See [B1], [M4], [R3], [V2]) Consider for example the well-known recursive definition F . Interpreted as a fixpoint equation over the flat cpo of non-negative integers it has as its least solution f(x, y) = 0 if x&equil;m for any non-negative integer m &equil; @@@@ otherwise (“@@@@” means undefined) This also happens to coincide with the computed function if a call-by-name (or outside-in) evaluation mechanism is used. However if a call-by-value (or inside-out) evaluation mechanism is used the computed function is fv (x, y) &equil; 0 if x&equil;0 &equil; @@@@ otherwise In [Vl] the conclusion is drawn that the call-by-value evaluation mechanism is incorrect and should not be considered.