Abstract
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.
Acknowledgment of Sponsorship: The research which produced the information contained in this document was sponsored, in whole or in part, by the U.S. Air Force Systems Command, Rome Air Development Center, Griffiss AFB, New York 13441-5700under Contract No. F30602-85-C-0098.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Abdali, S. K. (1976): “An Abstraction Algorithm for Combinatory Logic”, Journal of Symbolic Logic 41, pp. 222–224.
Barendregt, H. P. (1976): “A Global Representation of the Recursive Functions in the λ-calculus”, Theoretical Computer Science 3, pp. 225–242.
Barendregt, H. P. (1984): The Lambda Calculus: Its Syntax and Semantics, North-Holland Publishing Company, Amsterdam, New York, and Oxford.
Curry, Haskell Brooks and Feys, Robert (1958): Combinatory Logic, vol. 1, North-Holland Publishing Company, Amsterdam. Reprinted 1968 and 1974.
Curry, Haskell Brooks and Hindley, J. Roger and Seldin, Jonathan P. (1972): Combinatory Logic, vol. 2, North-Holland Publishing Company, Amsterdam and London.
Church, Alonzo (1941): The Calculi of Lambda Conversion, Princeton University Press, Princeton.
Curry, Haskell Brooks (1933): “Apparent Variables from the Standpoint of Combinatory Logic”, Annals of Mathematics 34, pp. 381–404.
Hindley, J. Roger and Seldin, Jonathan P. (1986): Introduction to Combinators and λ- calculus, Cambridge University Press.
Kleene, Stephen Cole (1936): “λ-definability and Recursiveness”, Duke Mathematical Journal 2, pp. 340–353.
Meyer, Albert R. (1982): “What is a Model of the Lambda Calculus?”, Information and Control 52, pp. 87–122.
Pottinger, Garrel (1987): “Lambda Binding without Bound Variables”, Technical Report TR 11-4. Revised January 1988.
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.
Pottinger, Garrel (1988): “Ulysses: Logical Foundations of the Definition Facility”, Technical Report TR 11–9.
Rosser, J. B. (1935): “A Mathematical Logic without Variables I”, Annals of Mathematics 36, pp. 127–150.
Rosser, J. B. (1935): “A Mathematical Logic without Variables II”, Duke Mathematical Journal 11 pp. 328–355.
Rosenbloom, P. C. (1950): The Elements of Mathematical Logic, New York.
Turing, Alan M. (1937): “The p-function in λ-K-conversion”, Journal of Symbolic Logic 2, p. 164.
Turner, David (1984): “Combinator Reduction Machines”, in International Workshop on High-level Computer Architecture, Department of Computer Science, University of Maryland.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Kluwer Academic Publishers
About this chapter
Cite this chapter
Pottinger, G. (1990). A Tour of the Multivariate Lambda Calculus. In: Dunn, J.M., Gupta, A. (eds) Truth or Consequences. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0681-5_14
Download citation
DOI: https://doi.org/10.1007/978-94-009-0681-5_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6791-1
Online ISBN: 978-94-009-0681-5
eBook Packages: Springer Book Archive