Enriching the lambda calculus with contexts
- 15 June 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 31 (6) , 239-250
- https://doi.org/10.1145/232629.232652
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A theory of binding structures and applications to rewritingTheoretical Computer Science, 1993
- Quasi-static scopingPublished by Association for Computing Machinery (ACM) ,1993
- A denotational semantics of inheritance and its correctnessPublished by Association for Computing Machinery (ACM) ,1989
- Inheritance in smalltalk-80: a denotational definitionPublished by Association for Computing Machinery (ACM) ,1988
- A unified system of parameterization for programming languagesPublished by Association for Computing Machinery (ACM) ,1988
- A consistent extension of the lambda-calculus as a base for functional programming languagesInformation and Control, 1982
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972