How to Circumvent Church Numerals.

Mayer Goldberg, Mads Torgersen

Research output: Contribution to journalArticlepeer-review

Abstract

In this work we consider a standard numeral system in the lambda-calculus, and the elementary arithmetic and Boolean functions and predicates defined on this numeral system, and show how to construct terms that "circumvent" or "defeat" these functions: The equality predicate is satisfied when comparing these special terms to any numeral, the zero predicate is satisfied for these terms, etc. We believe this exercise offers an instructive look at what definability means in the untyped lambda-calculus.
Original languageEnglish GB
Pages (from-to)1-12
JournalNord. J. Comput.
Volume9
Issue number1
StatePublished - 2002

Fingerprint

Dive into the research topics of 'How to Circumvent Church Numerals.'. Together they form a unique fingerprint.

Cite this