A simple proof of the undecidability of inhabitation in λP

Journal of Functional Programming

Volumn 6, Issue 5, 1996, Pages 757-761

  Bezem, Marc ^a   Springintveld, Jan ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030372762     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001969     Document Type: Article

References (6)

1. Barendregt, H. P. (1992) Lambda calculi with types. In S. Abramsky, D. M. Gabbay and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 2, pp. 117-309. Oxford Science Publications.
2. st Annual Workshop 'Types for Proofs and Programs' TYPES '93: Nijmegen, The Netherlands, Lecture Notes in Computer Science 806, pp. 79-108. Springer-Verlag.
3. Löb, M. H. (1976) Embedding first order predicate logic in fragments of intuitionistic logic. J. Symbolic Logic 41 705-719.
4. Shepherdson, J. C. (1985) Undecidability of Horn clause logic and pure Prolog. Unpublished manuscript.
5. Shepherdson, J. C. and Sturgis, H. E. (1963) Computability of recursive functions. J. ACM 10: 217-255.
6. Springintveld, J. (1995) Algorithms for type theory. Phd thesis, Department of Philosophy, Utrecht University.