A Syntactic Theory of Message Passing
Journal of the ACM (JACM)
Garbage collection and task deletion in distributed applicative processing systems
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Nondeterministic call by need is neither lazy nor by name
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The incremental garbage collection of processes
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
| Hi-index | 0.00 |
The expressive power of a particular applicative language may be characterized by the set of abstract functions directly representable in that language the common FUNARG and applicative order problems are scrutinized in this way, and the effects of these weaknesses are related to inexpressibility of classes of functions. Certain computable functions which are inexpressible in the lambda calculus are identified, and it is established that the interpretations of these functions requires a mechanism fundamentally equivalent to multiprocessing. The EITHER construct is proposed as an extension to the lambda calculus, and several theories including this mechanism are presented and proved consistent (in the sense that they introduce no new equivalences into the lambda calculus). A syntactic analog to the Scott construction, *-conversion, is developed in conjunction with these theories; this adjunct allows reduction of expressions having no normal forms in the usual lambda calculus to finite normal form approximations of the expressions. This leads naturally to a technique for proving the extensional equivalence of lambda calculus expressions which are not interconvertible.