@article{ade4c37f3ac642e9b5ebdebfb645f3e8,

title = "Theoretical Pearl - An adequate and efficient left-associated binary numeral system in the Lambda-calculus.",

abstract = "This paper introduces a sequence of λ-expressions modeling the binary expansion of integers. We derive expressions computing the test for zero, the successor function, and the predecessor function, thereby showing the sequence to be an adequate numeral system, ie one in which all recursive functions are lambda-definable. These functions can be computed efficiently; To this end, we introduce a notion of complexity that is independent of the order of evaluation.",

author = "Mayer Goldberg",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2000",

language = "אנגלית",

volume = "10",

pages = "607--623",

journal = "Journal of Functional Programming",

issn = "1469-7653",

publisher = "Cambridge University Press",

number = "6",

}