Enriching the lambda calculus with contexts: Toward a theory of incremental program construction

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 239-250

  Lee, Shinn Der ^a   Friedman, Daniel P ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144398051     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232652     Document Type: Article

References (21)

1. Hassan Aït-Kaci and Jacques Garrigue. Label-selective λ-calculus: Syntax and confluence. In Proc. of the 13th International Conf. on Foundations of Software Technologies and Theoretical Computer Science, pages 24-40, Springer-Verlag, 1993.
2. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Revised edition, North-Holland, 1984.
3. Klaus J. Berkling and Elfriede Fehr. A consistent extension of the lambda-calculus as a base for functional programming languages. Information and Control, 55:89-101, 1982.
4. Luca Cardelli and John C. Mitchell. Operations on records. In [8].
5. William Cook and Jens Palsberg. A denotational semantics of inheritance and its correctness. In Proc. of the ACM Conf. on Object-Oriented Programming: Systems, Languages and Applications, pages 433-443, 1989.
6. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indagationes Mathematicae, 34:381-392, 1972.
7. Laurent Dami. Software Composition: Towards an Integration of Functional and Object-Oriented Approaches. PhD thesis, University of Geneva, 1994.
8. Carl A. Gunter and John C. Mitchell. Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design. MIT Press, 1994.
9. Stanley Jefferson, Shinn-Der Lee, and Daniel P. Friedman. A syntactic theory of transparent parameterization. In Proc. of the Third European Symp. on Programming, pages 211-226, Springer-Verlag, 1990.
10. Samuel N. Kamin. Inheritance in Smalltalk-80: A denotational definition. In Proc. of the Fifteenth ACM Symp. on Principles of Programming Languages, pages 80-87, 1988.
11. John Lamping. A unified system of parameterization for programming languages. In Proc. of the ACM Conf. on Lisp and Functional Programming, pages 316-326, 1988.
12. Shinn-Der Lee and Daniel P. Friedman. Quasi-static scoping: Sharing variable bindings across multiple lexical scopes. In Proc. of the Twentieth ACM Symp. on Principles of Programming Languages, pages 479-492, 1993.
13. John McCarthy. Towards a mathematical science of computation. In Proc. of IFIP Congress 63, pages 21-28. North-Holland, 1963.
14. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
15. James H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, 1968.
16. Simon L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice Hall, 1987.
17. Gordon D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
18. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
19. Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1981.
20. Carolyn Talcott. A theory of binding structures and applications to rewriting. Theoretical Computer Science, 112:99-143, 1993.
21. Mitchell Wand. Type inference for objects with instance variables and inheritance. In [8].