Abstract

We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers (or of a lambdadefinable function of positive integers). The phrase in parentheses refers to the apparatus which Church had developed to investigate this and other problems in the foundations of mathematics: the calculus of lambda conversion. Both the Thesis and the lambda calculus have been of seminal influence on the development of Computing Science. The main subject of this article is the lambda calculus but I will begin with a brief sketch of the emergence of the Thesis. The epistemological status of Church’s Thesis is not immediately clear from the above quotation and remains a matter of debate, as is explored in other papers of this volume. My own view, which I will state but not elaborate here, is that the thesis is empirical because it relies for its significance on a claim about what can be calculated by mechanisms. This becomes clearer in

Citations

1224	Lectures on constructive functional programming - Bird - 1989
402	Domain Theory, in - Abramsky, Jung - 1994
363	LCF considered as a programming language - Plotkin - 1977
290	The calculi of lambda-conversion - Church - 1941
242	Programming in Martin-Löf’s Type Theory. An Introduction - Nordström, Petersson, et al. - 1990
214	An unsolvable problem of elementary number theory - Church - 1936
199	Data types as lattices - Scott - 1976
178	A new implementation technique for applicative languages - Turner - 1979
164	The next 700 programming languages - Landin - 1966
135	Miranda—a non-strict functional language with polymorphic types - Turner - 1996
114	C.: Toward a mathematical semantics for computer languages - Scott, Strachey - 1971
100	98 language and libraries: the Revised Report - Haskell - 2003
95	An overview of Miranda - Turner - 1986
76	Constable et al. Implementing Mathematics with the Nuprl Proof Development System - L - 1986
65	Über die bausteine der mathematischen logik - Schönfinkel - 1924
63	et al. Report on the programming language Haskell: A non-strict, purely functional language. Version 1.2 - Hudak, Jones, et al. - 1992
59	An Intuitionistic Theory of Types - Martin-Lof - 1973
45	Constructive set theory - Myhill - 1975
38	and Gérard Huet. The Calculus of Constructions - Coquand - 1988
38	On undecidable proposition of formal mathematical systems - Gödel - 1934
36	A semantic analysis of structural recursion - Abel - 1999
34	SASL language manual - Turner - 1975
20	Another Algorithm for Bracket Abstraction - Turner - 1979
19	Computational foundations of basic recursive function theory - Constable, Smith - 1993
18	Partial Objects in Type Theory - Smith - 1989
16	Walther recursion - McAllester, Arkoudas
11	Turing: “On Computable Numbers, with an Application to the Entscheidungsproblem - M
10	Ensuring termination in ESFP - Telford, Turner
7	On a hitherto unutilized extension of the finitary standpoint - Gödel - 1990
7	Sur la non-contradiction de l’arithmétique, Jounal für die reine und angewandteMathematik 166: 1–8. English translation in [Herbrand - Herbrand - 1971
6	Barendregt: The Lambda Calculus, its Syntax and semantics - P - 1984
6	Choice Implies Excluded Middle”, Zeit. Logik und Grundlagen der - Goodman, Myhill
5	Experience with a large scientific application in a functional language - Page - 1993
5	Jones: Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Peyton - 1992
4	Pitts “A Co-induction Principle for Recursively Defined Domains - M - 1994
3	Cooperative Association for Internet Data Analysis (CAIDA), http://www.caida.org - John - 1960
2	Une extension de l'interpretation fonctionnelle de Godel `a l'analyse et son application `a l"elimination des coupures dans l'analyse et la th'eorie des types - Girard - 1971
2	The convergence of mildly context-sensitive grammatical formalisms - unknown authors - 1991
1	Review of A M Turing (1936) “On computable numbers - Church - 1937
1	cell survival gene ced-9 encodes a functional homolog of the mammalian proto-oncogene bcl-2, Cell 1994, 76(4):665-76 Publish with BioMed Central and every scientist can read your work free of charge "BioMedcentral will be the most significant develop - unknown authors - 1958
1	This and other papers of Escardo can be found at http://www.cs.bham.ac.uk/∼mhe/papers - Edalat, McCusker - 1996
1	Published by Oxford University Computing - Thesis - 1983
1	The Formulae as Types Notion of Construction”, privately circulated letter - Howard - 1969
1	Long Distance Scrambling and Tree Adjoining Grammars - unknown authors - 1991
1	Kleene “Lambda-Definability and Recursiveness - C - 1936
1	pp 167–184.) R. Milner “A Theory of Type Polymorphism - unknown authors - 1985
1	Strachey “Fundamental Concepts in Programming Languages”, originally notes for an International Summer School on computer programming - Christopher - 1967
1	Abstract Stone Duality”, privately circulated, 2002 — this and published papers about ASD can be found at http://www.cs.man.ac.uk/∼pt/ASD - Taylor