| AUT092 | All material (C)opyright
2004 - The Automath Archive, Eindhoven University of Technology |
| Title: | Generalizing AUTOMATH by means of a lambda-typed lambda calculus |
| Author: | N.G. de Bruijn |
| Printed: | Mathematical Logic and Theoretical Computer Science, Lecture notes in pure and applied mathematics, 106, ed. D.W. Kueker, E.G.K. Lopez-Escobar, C.H.Smith, Marcel Dekker, pp. 71-92 |
| Publishing date: | 1987 |
| Publishing location: | New York |
| Pages: | 22 |
| Language: | English |
| Note: | Also published in Selected Papers on Automath, Studies in Logic and the Foundations of Mathematics, Vol. 133, Ed. R.P. Nederpelt, J.H. Geuvers and R.C. de Vrijer, chapter B7, pp. 313-338 |
| Browse: | Click here to browse a webversion of this article |
| Download this article: | FAX-TIFF format, zip compressed |
| FAX-TIFF format, tar compressed | |
| PDF version | |
| JPG version |