Author:
Mason Ian,Talcott Carolyn
Abstract
AbstractTraditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the call-by-value lambda calculus results in a language with a rich equational theory, satisfying many of the usual laws. Combined with other recent work, this provides evidence that expressive, mathematically clean programming languages are indeed possible.
Publisher
Cambridge University Press (CUP)
Reference43 articles.
1. A theory of variable types;Feferman;Revista Colombiana de Matématicas,1985
2. Guzmán J. C. and Hudak P. 1990. Single-threaded polymorphic lambda calculus. In Fifth Ann. Symposium on Logic in Computer Science.IEEE Press.
3. Viewing control structures as patterns of passing messages
4. Lucassen J. M. and Gifford D. K. 1988. Polymorphic effect systems. In Conf. record 16th Ann. ACM symposium on principles of programming languages, 47–57, ACM.
Cited by
88 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献