A typed context calculus
- 1 September 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 266 (1-2) , 249-272
- https://doi.org/10.1016/s0304-3975(00)00174-2
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Equational Reasoning for Linking with First-Class Primitive ModulesPublished by Springer Nature ,2000
- A lambda-calculus for dynamic bindingTheoretical Computer Science, 1998
- The feel of JavaComputer, 1997
- Enriching the lambda calculus with contextsACM SIGPLAN Notices, 1996
- Parallel Reductions in λ-CalculusInformation and Computation, 1995
- A λ-calculus structure isomorphic to Gentzen-style sequent calculus structurePublished by Springer Nature ,1995
- A theory of binding structures and applications to rewritingTheoretical Computer Science, 1993
- Explicit substitutionsJournal of Functional Programming, 1991
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977