Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 13
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Chihani, Zakaria Miller, Dale and Renaud, Fabien 2016. A Semantic Framework for Proof Evidence. Journal of Automated Reasoning,

    Benzmüller, Christoph and Miller, Dale 2014. Computational Logic.

    Harrison, John Urban, Josef and Wiedijk, Freek 2014. Computational Logic.

    Percival, Philip 2011. Predicate abstraction, the limits of quantification, and the modality of existence. Philosophical Studies, Vol. 156, Issue. 3, p. 389.

    Sousa, Joao Pedro 2010. 2010 International Conference on Complex, Intelligent and Software Intensive Systems. p. 9.

    Cardone, Felice and Hindley, J. Roger 2009. Logic from Russell to Church.

    Mariangiola, Dezani-Ciancaglini and Hindley, J. Roger 2008. Wiley Encyclopedia of Computer Science and Engineering.

    Sørensen, M.H. and Urzyczyn, P. 2006. Lectures on the Curry-Howard Isomorphism.

    Sørensen, M.H. and Urzyczyn, P. 2006. Lectures on the Curry-Howard Isomorphism.

    Klement, Kevin 2003. Russell's 1903 - 1905 Anticipation of the Lambda Calculus. History and Philosophy of Logic, Vol. 24, Issue. 1, p. 15.

    Barendregt, Henk and Cohen, Arjeh M. 2001. Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants. Journal of Symbolic Computation, Vol. 32, Issue. 1-2, p. 3.

    Barendregt, Henk and Geuvers, Herman 2001. Handbook of Automated Reasoning.

    Berline, Chantal 2000. From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoretical Computer Science, Vol. 249, Issue. 1, p. 81.


The Impact of the Lambda Calculus in Logic and Computer Science

  • Henk Barendregt (a1)
  • DOI:
  • Published online: 15 January 2014

One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2]W. Ackermann , Zum Hilbertschen Aufbau der reellen Zahlen, Mathematische Annalen, vol. 99 (1928), pp. 118133.

[4]D. Aspinall and A. Compagnoni , Subtyping dependent types, Proceedings of the 11th annual symposium on logic in computer science (New Brunswick, New Jersey) (E. Clarke , editor), IEEE Computer Society Press, 071996, pp. 8697.

[5]J. W. Backus , Can programming be liberatedfrom the von Neuman style?, Comm. ACM, vol. 21 (1978), pp. 613641.

[10]H. P. Barendregt , Enumerators of lambda terms are reducing constructively, Annals of Pure and Applied Logic, vol. 73 (1995), pp. 39.

[13]H. P. Barendregt , M. Bunder , and W. Dekkers , Systems of illative combinatory logic complete for first order propositional and predicate calculus, Journal of Symbolic Logic, vol. 58 (1993), no. 3, pp. 89108.

[19]A. Berarducci and C. Böhm , A self-interpreter of lambda calculus having a normal form, Lecture Notes in Computer Science, vol. 702 (1993), pp. 8599.

[22]C. Böhm and A. Berarducci , Automatic synthesis of typed λ-programs on term algebras, Theoretical Computer Science, vol. 39 (1985), pp. 135154.

[26]N. G. de Bruijn , The mathematical language AUTOMATH, its usage and some of its extensions, Symposium on automatic demonstration (Berlin and New York) (M. Laudet , D. Lacombe , and M. Schuetzenberger , editors), Lecture Notes in Mathematics, vol. 125, Springer-Verlag, 1970, pp. 2961, also in [88], pp. 73–100.

[28]A. Church , An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58 (1936), pp. 354363.

[31]A. Church and J. B. Rosser , Some properties of conversion, Transactions of the American Mathematical Society, vol. 39 (1936), pp. 472482.

[33]T. Coquand and G. Huet , The calculus of constructions, Information and Computation, vol. 76 (1988), no. 2/3, pp. 95120.

[34]G. Cousineau , P.-L. Curien , and M. Mauny , The categorical abstract machine, Science of Computer Programming, vol. 8 (1987), no. 2, pp. 173202.

[36]H. B. Curry , Grundlagen der kombinatorischen Logik, American Journal of Mathematics, vol. 52 (1930), pp. 509–536, 789834, in German.

[37]H. B. Curry , Functionality in combinatory logic, Proceedings of the National Academy of Science of the USA, vol. 20 (1934), pp. 584590.

[38]H. B. Curry , Modified basic functionality in combinatory logic, Dialectica, vol. 23 (1969), pp. 8392.

[44]S. Feferman , Definedness, Erkentniss, vol. 43 (1995), pp. 295320.

[46]R. O. Gandy , Church's Thesis and principles for mechanisms, The Kleene symposium, North-Holland Publishing Company, Amsterdam, 1980, pp. 123148.

[48]G. Gentzen , Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, vol. 39 (1935), pp. 176–210, 405431, also available in [111], pp 68–131.

[50]J.-Y. Girard , Linear logic: its syntax and semantics, Advances in linear logic (J.-Y. Girard , Y. Lafont , and L. Regnier , editors), London Mathematical Society Lecture Note Series, Cambridge University Press, 1995, available by anonymous ftp from as /pub/girard/

[53]K. Grue , Map theory, Theoretical Computer Science (1992), pp. 1133.

[59]R. Hindley , The principal type-scheme of an object in combinatory logic, Transactions of the American Mathematical Society, vol. 146 (1969), pp. 2960.

[62]P. Hudak et al., Report on the programming language Haskell: A non-strict, purely functional language (Version 1.2), ACM SIGPLAN Notices, vol. 27 (1992), no. 5, pp. Ri–Rx, R1R163.

[64]R. J. M. Hughes , Why functional programming matters, The Computer Journal, vol. 32 (1989), no. 2, pp. 98107.

[66]T. Johnsson , Efficient compilation of lazy evaluation, SIGPLAN Notices, vol. 19 (1984), no. 6, pp. 5869.

[67]S. C. Kleene , Lambda-definability and recursiveness, Duke Mathematical Journal, vol. 2 (1936), pp. 340353.

[70]S. C. Kleene , Origins of recursive function theory, Annals of the History of Computing, vol. 3 (1981), no. 1, pp. 5267.

[71]S. C. Kleene and J. B. Rosser , The inconsistency of certain formal logics, Annals of Mathematics, vol. 36 (1935), pp. 630636.

[72]C. P. J. Koymans , Models of the lambda calculus, Information and Control, vol. 52 (1982), no. 3, pp. 306323.

[75]J. Kuper , An axiomatic theory for partial functions, Information and Computation (1993), pp. 104150.

[77]P. J. Landin , The mechanical evaluation of expressions, The Computer Journal, vol. 6 (1964), no. 4, pp. 308320.

[84]R. Milner , A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol. 17 (1978), pp. 348375.

[93]G. D. Plotkin , Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science, vol. 1 (1975), pp. 125159.

[97]J. C. Reynolds , The discoveries of continuations, LISP and Symbolic Computation, vol. 6 (1993), no. 3/4, pp. 233247.

[98]R. M. Robinson , The theory of classes—a modification of von Neumann's system, Journal of Symbolic Logic, vol. 2 (1937), pp. 2936.

[102]D. S. Scott , Constructive validity, Symposium on automated demonstration (D. Lacombe , M. Laudet and M. Schuetzenberger , editors), Lecture Notes in Mathematics, vol. 125, Springer-Verlag, Berlin, 1970, pp. 237275.

[105]R. K. Shyamasundar (editor), Proceedings of the 13th conference on foundations of software technology and theoretical computer science, Lecture Notes in Computer Science, vol. 761, Berlin and New York, Bombay, India, Springer-Verlag, 1993.

[107]M. B. Smyth and G. D. Plotkin , The category-theoretic solution of recursive domain equations, SIAM Journal on Computing, vol. 11 (1982), no. 4, pp. 761783.

[108]R. Statman , The typed lambda calculus is not elementary recursive, Theoretical Computer Science, vol. 9 (1979), pp. 7381.

[112]A. S. Troelstra (editor), Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin and New York, 1973.

[116]D. A. Turner , A new implementation technique for applicative languages, Software—Practice andExperience, vol. 9 (1979), pp. 3149.

[118]D. A. Turner , Miranda—a non-strict functional language with polymorphic types, Functional programming languages and computer architectures (Berlin and New York) (J. P. Jouannaud , editor), Lecture Notes in Computer Science, vol. 201, Springer-Verlag, 1985, pp. 116.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of Symbolic Logic
  • ISSN: 1079-8986
  • EISSN: 1943-5894
  • URL: /core/journals/bulletin-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *