Hostname: page-component-cb9f654ff-p5m67 Total loading time: 0 Render date: 2025-08-22T04:08:50.317Z Has data issue: false hasContentIssue false
  • English
  • Français

Theoretical Pearls

An unsolvable numeral system in lambda calculus

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Erik Barendsen
Erik Barendsen
Affiliation:
Department of Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands. E-mail: erikb@cs.kun.nl.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For numeral systems in untyped λ-calculus the definability of a successor, a predecessor and a test for zero implies the definability of all recursive functions on that system. Towards a disproof of the converse statement, H. P. Barendregt and the author constructed a numeral system consisting of unsolvable λ-terms, being adequate for unary functions. Then, independently, B. Intrigila found an analogous system for all computable functions.

Information

Type
Articles
Information
Journal of Functional Programming , Volume 1 , Issue 3 , July 1991 , pp. 367 - 372
Copyright
Copyright © Cambridge University Press 1991

References

Barendregt, H. P. (1984) The lambda calculus: its syntax and semantics, Studies in logic 103. North-Holland.Google Scholar
Intrigila, B. 1990. Some results on numeral systems in λ-calculus. Typescript, Rome, Italy.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.