Hostname: page-component-6766d58669-nf276 Total loading time: 0 Render date: 2026-05-20T18:18:10.521Z Has data issue: false hasContentIssue false
  • English
  • Français

A simple proof of the undecidability of inhabitation in λP

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Marc Bezem  and
Jan Springintveld
Marc Bezem*
Affiliation:
Department of Philosophy, Utrecht University, P.O. Box 80126, 3508 TC Utrecht, The Netherlands
Jan Springintveld*
Affiliation:
Computing Science Institute, University of Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
*
†Supported by the Netherlands Computer Science Research Foundation (SION)with financial support of the Netherlands Organisation for Scientific Research(NWO).
†Supported by the Netherlands Computer Science Research Foundation (SION)with financial support of the Netherlands Organisation for Scientific Research(NWO).
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Articles
Information
Journal of Functional Programming , Volume 6 , Issue 5 , September 1996 , pp. 757 - 761
Copyright
Copyright © Cambridge University Press 1996

References

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.Google Scholar
Geuvers, H. (1993) Conservativity between logics and typed λ calculi. In H. P., Barendregt and T., Nipkow, editors, Proceedings of the 1st Annual Workshop ‘Types for Proofs and Programs’ TYPES '93: Nijmegen, The Netherlands, Lecture Notes in Computer Science 806, pp. 79–108. Springer-Verlag.Google Scholar
Löb, M. H. (1976) Embedding first order predicate logic in fragments of intuitionistic logic. J. Symbolic Logic 41 705–719.CrossRefGoogle Scholar
Shepherdson, J. C. (1985) Undecidability of Horn clause logic and pure Prolog. Unpublished manuscript.Google Scholar
Shepherdson, J. C. and Sturgis, H. E. (1963) Computability of recursive functions. J. ACM 10: 217–255.CrossRefGoogle Scholar
Springintveld, J. (1995) Algorithms for type theory. Phd thesis, Department of Philosophy, Utrecht University.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.