A lambda-calculus for dynamic binding
- 20 February 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 192 (2) , 201-231
- https://doi.org/10.1016/s0304-3975(97)00150-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A typed context calculusTheoretical Computer Science, 2001
- Sonia: An adaptation of Linda for coordination of activities in organizationsPublished by Springer Nature ,1996
- Parallel Reductions in λ-CalculusInformation and Computation, 1995
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- A theory of binding structures and applications to rewritingTheoretical Computer Science, 1993
- Inheritance as implicit coercionInformation and Computation, 1991
- Type inference for record concatenation and multiple inheritanceInformation and Computation, 1991
- A modest model of records, inheritance, and bounded quantificationInformation and Computation, 1990
- A semantics of multiple inheritanceInformation and Computation, 1988