Godelization in the lambda calculus

Information Processing Letters

Volumn 75, Issue 1, 2000, Pages 13-16

  Goldberg, Mayer ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); MATHEMATICAL OPERATORS; THEOREM PROVING;

LAMBDA CALCULUS;

COMPUTATIONAL LINGUISTICS;

EID: 0034227573     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00071-5     Document Type: Article

References (10)

1. Barendregt H.P. The Lambda Calculus, Its Syntax and Semantics. 1984;North-Holland, Amsterdam.
2. Berger U., Schwichtenberg H. An inverse of the evaluation functional for typed λ -calculus. Proc. 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam. July 1991;203-211.
3. Church A. The Calculi of Lambda-Conversion. 1941;Princeton University Press, Princeton, NJ.
4. Clinger W., Rees J. Revised report on the algorithmic language Scheme, LISP Pointers IV (3). 1991;1-55.
5. Danvy O. Type-directed partial evaluation. Hatcliff J., Mogensen T.Æ, Thiemann P. Partial Evaluation - Practice and Theory; Proceedings of the 1998 DIKU Summer School, Copenhagen, Denmark. Lecture Notes in Comput. Sci. Vol. 1706:1998;367-411 Springer, Berlin. Extended version available as the lecture notes BRICSLN-98-3.
6. Gödel K. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik. Vol. 38:1931;173-198.
7. Goldberg M. Gödelization in the λ -calculus (extended version). BRICS Research Series RS-96-5. March 1996;Department of Computer Science, University of Aarhus, Denmark. A revision of BRICS report RS-95-38.
8. Goldberg M. Recursive application survival in the λ -calculus. Ph.D. Thesis:1996;Department of Computer Science, Indiana University, Bloomington, IN.
9. Mitchell J.C. Foundations of Programming Languages. 1996;MIT Press, Cambridge, MA.
10. Mogensen T.Æ. Efficient self-interpretation in lambda calculus. Funct. Programming. Vol. 2:(3):1992;345-364.