We discuss a lambda calculus in which a single λ may bind an arbitrary finite sequence of variables. This introduces terms of the form λx 0…x n −1 · X which are not the result of performing n univariate abstractions. For example, we have λxy · x ≠ λx · λy · x. Redexes have the form (λx 0…x n −1 · X) Y 0… Y n −1, and such a redex contracts to the result of simultaneously substituting Y0,…, Y n −1 for x 0,…,x n −1 in X.
KeywordsEnvironment Model Term Structure Preceding Paragraph Recursive Function Combinatory Model
Unable to display preview. Download preview PDF.
- [Bar84]Barendregt, H. P. (1984): The Lambda Calculus: Its Syntax and Semantics, North-Holland Publishing Company, Amsterdam, New York, and Oxford.Google Scholar
- [CF58]Curry, Haskell Brooks and Feys, Robert (1958): Combinatory Logic, vol. 1, North-Holland Publishing Company, Amsterdam. Reprinted 1968 and 1974.Google Scholar
- [CHS72]Curry, Haskell Brooks and Hindley, J. Roger and Seldin, Jonathan P. (1972): Combinatory Logic, vol. 2, North-Holland Publishing Company, Amsterdam and London.Google Scholar
- [Chu41]Church, Alonzo (1941): The Calculi of Lambda Conversion, Princeton University Press, Princeton.Google Scholar
- [HS 86]Hindley, J. Roger and Seldin, Jonathan P. (1986): Introduction to Combinators and λ- calculus, Cambridge University Press.Google Scholar
- [Pot87]Pottinger, Garrel (1987): “Lambda Binding without Bound Variables”, Technical Report TR 11-4. Revised January 1988.Google Scholar
- [Pott88a]Pottinger, Garrel (1988): “Enriched Lambda Calculi”, Odyssey Research Associates. The first version of this document was actually written in the fall of 1985 and privately circulated.Google Scholar
- [Pott88b]Pottinger, Garrel (1988): “Ulysses: Logical Foundations of the Definition Facility”, Technical Report TR 11–9.Google Scholar
- [Ros50]Rosenbloom, P. C. (1950): The Elements of Mathematical Logic, New York.Google Scholar
- [Tur84]Turner, David (1984): “Combinator Reduction Machines”, in International Workshop on High-level Computer Architecture, Department of Computer Science, University of Maryland.Google Scholar