The evolution of type theory in logic and mathematics

ion Principle 1.1 "If in an expression, f . . . j a simple or a compound sign has one or more occurrences and if we regard that sign as replaceable in all or some of these occurrences by something else {but everywhere by the same thing), then we call the part that remains invariant in the expression a function, and the replaceable part the argument of the function." (Begriffsschrift, Section 9) Frege put no restrictions on what could play the role of an argument. An argument could be a number (as was the situation in analysis), but also a proposition, or a function. Similarly, the result of applying a function to an argument did not necessarily have to be a number. Functions of more than one argument were constructed by a method that is very close to the method presented by Schonfinkel [109] in 1924: Abstraction Principle 1.2 "If, given a function, we think of a sign1 that was hitherto regarded as not replaceable as being replaceable at some or all of 1 We can now regard a sign that previously was considered replaceable as replaceable also in those places in which up to this point it was considered fixed. [footnote by Frege]ion Principle 1.2 "If, given a function, we think of a sign1 that was hitherto regarded as not replaceable as being replaceable at some or all of 1 We can now regard a sign that previously was considered replaceable as replaceable also in those places in which up to this point it was considered fixed. [footnote by Frege] lb Paradox threats in formal systems .19 it.s occurrences, then by adopting thi.s conception we obtain a function that ha.s a new argument in addition to tho.se it had before." (Begriff.s.schrift, Section 9) With this definition of function, two of the three possible paradox threats mentioned on p. 16 occurred: 1. The generalisation of the concept of function made the system more abstract and less intuitive. The fact that functions could have different types of arguments is at the basis of the Russell Paradox; 2. Frege introduced a formal system instead of the informal systems that were used up till then. Type theory, that would be helpful in distinguishing between the different types of arguments that a function might take, was left informal. So, Frege had to proceed with caution. And so he did, at this stage. He remarked that "if the [ ... ]letter [sign] occurs as a function sign, this circumstance [should] be taken into account." (Begriff.s.schrift, Section 11) This could be interpreted as if Frege was aware of some typing rule that does not allow to substitute functions for object variables or objects for function variables. In his paper Function and Concept [4 7], Frege more explicitly stated: " Now just as functions are fundamentally different from objects, so also functions whose arguments are and must be functions are fundamentally different from functions whose arguments are objects and cannot be anything else. I call the latter first-level, the former second-level." (Function and Concept, pp. 26-27)

[1]  A. Cauchy Cours d'analyse de l'École royale polytechnique , 1821 .

[2]  G. W. Leibniz,et al.  Die Philosophischen Schriften von Gottfried Wilhelm Leibniz , 1875 .

[3]  Gottlob Frege,et al.  Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens , 1879 .

[4]  G. Frege Die Grundlagen der Arithmetik : eine logisch mathematische Untersuchung über den Begriff der Zahl , 1884 .

[5]  C. Burali-Forti Una questione sui numeri transfiniti , 1897 .

[6]  G. Cantor,et al.  Beiträge zur Begründung der transfiniten Mengenlehre. (Zweiter Artikel.) , 2022 .

[7]  B. Russell Mathematical Logic as Based on the Theory of Types , 1908 .

[8]  G. M.,et al.  The Thirteen Books of Euclid's Elements , 1909, Nature.

[9]  M. Schönfinkel Über die Bausteine der mathematischen Logik , 1924 .

[10]  A. Church A Set of Postulates for the Foundation of Logic , 1932 .

[11]  H B Curry,et al.  Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[13]  A. Church The calculi of lambda-conversion , 1941 .

[14]  H. B. Curry The inconsistency of certain formal logics , 1942, Journal of Symbolic Logic.

[15]  Eric T. Bell,et al.  The Philosophy of Mathematics , 1950 .

[16]  R. Dedekind Stetigkeit und irrationale Zahlen , 2022 .

[17]  Haskell B. Curry,et al.  Foundations of Mathematical Logic , 1964 .

[18]  R. L. Goodstein MATHEMATICAL LOGIC AND THE FOUNDATIONS OF MATHEMATICS , 1963 .

[19]  W. Tait Infinitely Long Terms of Transfinite Type , 1965 .

[20]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[21]  de Ng Dick Bruijn,et al.  The mathematical language AUTOMATH, its usage, and some of its extensions , 1970 .

[22]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[23]  van Dt Diederik Daalen,et al.  A description of Automath and some aspects of its language theory , 1973 .

[24]  de Ng Dick Bruijn Automath A Language for Mathematics , 1973 .

[25]  Robert Pieter Nederpelt Lazarom Strong normalization in a typed lambda calculus with lambda structured types , 1973 .

[26]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[27]  P. Martin-Löf An Intuitionistic Theory of Types: Predicative Part , 1975 .

[28]  Saul A. Kripke,et al.  Outline of a Theory of Truth , 1975 .

[29]  van Ls Bert Benthem Jutting A translation of Landau's "Grundlagen in AUTOMATH" , 1976 .

[30]  Alonzo Church,et al.  Comparison of Russell's resolution of the semantical antinomies with that of Tarski , 1976, Journal of Symbolic Logic.

[31]  J. Barkley Rosser,et al.  Highlights of the History of the Lambda-Calculus , 1982, Annals of the History of Computing.

[32]  Solomon Feferman,et al.  Toward useful type-free theories. I , 1984, Journal of Symbolic Logic.

[33]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[34]  Roel C. de Vrijer A Direct Proof of the Finite Developments Theorem , 1985, J. Symb. Log..

[35]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[36]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[37]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[38]  Martín Abadi,et al.  Explicit substitutions , 1989, POPL '90.

[39]  Zhaohui Luo,et al.  ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[40]  Robin Milner,et al.  Definition of standard ML , 1990 .

[41]  Rp Rob Nederpelt Type systems : basic ideas and applications , 1990 .

[42]  Mark-Jan Nederhof,et al.  Modular proof of strong normalization for the calculus of constructions , 1991, Journal of Functional Programming.

[43]  T. Streicher Semantics of Type Theory , 1991, Progress in Theoretical Computer Science.

[44]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[45]  Rp Rob Nederpelt The fine-structure of lambda calculus , 1992 .

[46]  Gerard R. Renardel de Lavalette Strictness Analysis via Abstract Interpretation for Recursively Defined Types , 1992, Inf. Comput..

[47]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[48]  Thorsten Altenkirch,et al.  Constructions, inductive types and strong normalization , 1993, CST.

[49]  L. S. van Benthem Jutting Typing in Pure Type Systems , 1993, Inf. Comput..

[50]  Fairouz Kamareddine,et al.  On Stepwise Explicit Substitution , 1993, Int. J. Found. Comput. Sci..

[51]  J. H. Geuvers Logics and type systems , 1993 .

[52]  Jeffery I. Zucker Formalization of Classical Mathematics in Automath , 1994 .

[53]  van Ls Bert Benthem Jutting Description of AUT-68 , 1994 .

[54]  de Ng Dick Bruijn,et al.  The Mathematical Vernacular, A Language for Mathematics with Typed Sets , 1994 .

[56]  Vaj Tijn Borghuis Coming to terms with modal logic : on the interpretation of modalities in typed lambda-calculus , 1994 .

[57]  Erik Poll,et al.  Pure Type Systems with Definitions , 1994, LFCS.

[58]  Twan Laan,et al.  A formalization of the ramified type theory , 1994 .

[59]  Gilles Barthe,et al.  Extensions of Pure Type Systems , 1995, TLCA.

[60]  Adriana B. Compagnoni,et al.  Higher-order subtyping with intersection types , 1995 .

[61]  Cj Roel Bloo,et al.  Preservation of strong normalisation for explicit substitution , 1995 .

[62]  William C. Frederick,et al.  A Combinatory Logic , 1995 .

[63]  Paul B. Jackson Enhancing the NUPRL Proof Development System and Applying it to Computational Abstract Algebra , 1995 .

[64]  Fairouz Kamareddine,et al.  The Barendregt Cube with Definitions and Generalised Reduction , 1996, Inf. Comput..

[65]  P. Severi Normalisation in lambda calculus and its relation to type inference , 1996 .

[66]  Fairouz Kamareddine,et al.  A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths , 1996, Log. J. IGPL.

[67]  Fairouz Kamareddine,et al.  Canonical typing and ∏-conversion in the Barendregt Cube , 1996, Journal of Functional Programming.

[68]  Fairouz Kamareddine,et al.  A correspondence between Nuprl and the Ramified Theory of Types , 1996 .

[69]  Rob Nederpelt,et al.  A modern elaboration of the ramified theory of types , 1996, Stud Logica.