Part of the Lecture Notes in Computer Science book series (LNCS, volume 87)
An approach to theorem proving on the basis of a typed lambda-calculus
KeywordsNormal Form Theorem Prove Language Theory Natural Deduction Mathematical Text
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.
Unable to display preview. Download preview PDF.
- N.G. de Bruijn, The mathematical language AUTOMATH, its usage and some of its extensions, Symposium on Automatic Demonstration, IRIA, Versailles, France, 1968. (Lecture notes in Mathematics, Vol. 125, pp. 29–61, Springer-Verlag, Berlin, 1970.)Google Scholar
- N.G. de Brujin, AUTOMATH, a language for mathematics, Lecture Notes prepared by B. Fawcett, Les Presses de l'Université de Montréal, Canada, 1973.Google Scholar
- D.T. van Daalen, A description of AUTOMATH and some aspects of its language theory, Proceedings of the Symposium APLASM, Vol. I, ed. P. Braffort, Orsay, France, 1973.Google Scholar
- D.T. van Daalen, The language theory of Automath, doctoral dissertation, Technol. University Eindhoven, The Netherlands, 1980.Google Scholar
- L.S. van Benhtem Jutting, Checking Landau's "Grundlagen" in the AUTOMATH system, doctoral dissertation, Technol. University Eindhoven, The Netherlands, 1977. (Mathematical Centre Tracts 83, Amsterdam, The Netherlands, 1979.)Google Scholar
- R.P. Nederpelt, Strong normalization in a typed lambda calculus with lambda structured types, doctoral dissertation, Technol. University Eindhoven, The Netherlands, 1973.Google Scholar
- R.P. Nederpelt, Presentation of natural deduction, Recueil des Travaux de l'Institut Mathématique, Nouvelle série, tome 2 (10), p. 115–126, Symposium: Set Theory, Foundations of Mathematics, Beograd, Jugo-Slavia, 1977.Google Scholar
- J. Zucker, Formalization of classical mathematics in AUTOMATH, Actes of the International Logic Colloquium, Clermont-Ferrand, France, 1975.Google Scholar
© Springer-Verlag Berlin Heidelberg 1980