A notation for lambda terms a generalization of environments
Authors:
- 30 May 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 198 (1-2) , 49-98
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theoryAnnals of Pure and Applied Logic, 1991
- Explicit substitutionsJournal of Functional Programming, 1991
- The calculus of constructionsInformation and Computation, 1988
- The categorical abstract machineScience of Computer Programming, 1987
- Categorical combinatorsInformation and Control, 1986
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- An efficient interpreter for the lambda-calculusJournal of Computer and System Sciences, 1981
- Lambda calculus with namefree formulas involving symbols that represent reference transforming mappingsIndagationes Mathematicae, 1978
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940