Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1985: Combinators and Functional Programming Languages pp 104–122Cite as

Combinators and lambda-calculus, a short outline

  • Conference paper
  • First Online:

  • 191 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 242))

Abstract

This article introduces the basic ideas of combinatory logic and lambda-calculus, to serve as background for the other papers in this volume. Typed and untyped systems are covered.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • BARENDREGT, H. P. [1984] The Lambda Calculus, its Syntax and Semantics, 2 ed., North-Holland Co., Amsterdam.

    Google Scholar 

  • CHURCH, A. [1941] The Calculi of Lambda Conversion, Princeton Univ. Press; reprinted 1963 by University Microfilms Inc., Ann Arbor, Michigan, U.S.A.

    Google Scholar 

  • CURRY, H. B. [1969] Modified basic functionality in combinatory logic, Dialectica 23, 83–92.

    Google Scholar 

  • — & FEYS, R. [1958] Combinatory Logic, Vol. I, North-Holland Co., Amsterdam.

    Google Scholar 

  • — & HINDLEY, J. R., SELDIN, J. P. [1972] Combinatory Logic, Vol. II, North-Holland Co., Amsterdam.

    Google Scholar 

  • HINDLEY, J. R. [1969] The principal type-scheme of an object in combinatory logic, Trans. American Math. Soc. 146, 29–60.

    Google Scholar 

  • — & SELDIN, J. P. [1985] Introduction to Combinators and λ-Calculus, Cambridge Univ. Press, England, 1985 or 86.

    Google Scholar 

  • PRAWITZ, D. [1965] Natural Deduction, Almgvist and Wiksell, Uppsala, Sweden.

    Google Scholar 

  • SCHONFINKEL, M. [1924] Uber die Bausteine der Mathematischen Logik, Math. Annalen 92, 305–16. (English Trans. in From Frege to Godel, ed. J. van Heijenoort, Harvard Univ. Press, 1967, pp. 355–66.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University College, SA2 8PP, Swansea, Wales, U. K.

    J. Roger Hindley

Authors
  1. J. Roger Hindley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Guy Cousineau Pierre-Louis Curien Bernard Robinet

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roger Hindley, J. (1986). Combinators and lambda-calculus, a short outline. In: Cousineau, G., Curien, PL., Robinet, B. (eds) Combinators and Functional Programming Languages. LITP 1985. Lecture Notes in Computer Science, vol 242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17184-3_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-17184-3_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17184-3

  • Online ISBN: 978-3-540-47253-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation