Advertisement

A Tour of the Multivariate Lambda Calculus

  • Garrel Pottinger
Chapter

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 0x 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 0x n −1 · X) Y 0Y 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.

Keywords

Environment Model Term Structure Preceding Paragraph Recursive Function Combinatory Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [Abd76]
    Abdali, S. K. (1976): “An Abstraction Algorithm for Combinatory Logic”, Journal of Symbolic Logic 41, pp. 222–224.CrossRefGoogle Scholar
  2. [Bar76]
    Barendregt, H. P. (1976): “A Global Representation of the Recursive Functions in the λ-calculus”, Theoretical Computer Science 3, pp. 225–242.CrossRefGoogle Scholar
  3. [Bar84]
    Barendregt, H. P. (1984): The Lambda Calculus: Its Syntax and Semantics, North-Holland Publishing Company, Amsterdam, New York, and Oxford.Google Scholar
  4. [CF58]
    Curry, Haskell Brooks and Feys, Robert (1958): Combinatory Logic, vol. 1, North-Holland Publishing Company, Amsterdam. Reprinted 1968 and 1974.Google Scholar
  5. [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
  6. [Chu41]
    Church, Alonzo (1941): The Calculi of Lambda Conversion, Princeton University Press, Princeton.Google Scholar
  7. [Cur33]
    Curry, Haskell Brooks (1933): “Apparent Variables from the Standpoint of Combinatory Logic”, Annals of Mathematics 34, pp. 381–404.CrossRefGoogle Scholar
  8. [HS 86]
    Hindley, J. Roger and Seldin, Jonathan P. (1986): Introduction to Combinators and λ- calculus, Cambridge University Press.Google Scholar
  9. [Kle36]
    Kleene, Stephen Cole (1936): “λ-definability and Recursiveness”, Duke Mathematical Journal 2, pp. 340–353.CrossRefGoogle Scholar
  10. [Mey82]
    Meyer, Albert R. (1982): “What is a Model of the Lambda Calculus?”, Information and Control 52, pp. 87–122.CrossRefGoogle Scholar
  11. [Pot87]
    Pottinger, Garrel (1987): “Lambda Binding without Bound Variables”, Technical Report TR 11-4. Revised January 1988.Google Scholar
  12. [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
  13. [Pott88b]
    Pottinger, Garrel (1988): “Ulysses: Logical Foundations of the Definition Facility”, Technical Report TR 11–9.Google Scholar
  14. [Ros35a]
    Rosser, J. B. (1935): “A Mathematical Logic without Variables I”, Annals of Mathematics 36, pp. 127–150.CrossRefGoogle Scholar
  15. [Ros35b]
    Rosser, J. B. (1935): “A Mathematical Logic without Variables II”, Duke Mathematical Journal 11 pp. 328–355.CrossRefGoogle Scholar
  16. [Ros50]
    Rosenbloom, P. C. (1950): The Elements of Mathematical Logic, New York.Google Scholar
  17. [Tur37]
    Turing, Alan M. (1937): “The p-function in λ-K-conversion”, Journal of Symbolic Logic 2, p. 164.CrossRefGoogle Scholar
  18. [Tur84]
    Turner, David (1984): “Combinator Reduction Machines”, in International Workshop on High-level Computer Architecture, Department of Computer Science, University of Maryland.Google Scholar

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Garrel Pottinger

There are no affiliations available

Personalised recommendations