Abstract
<p>This paper introduces a sequence of lambda-expressions, modelling the binary<br />expansion of integers. We derive expressions computing the test<br />for zero, the successor function, and the predecessor function, thereby<br />showing the sequence to be an adequate numeral system. These functions<br />can be computed efficiently. Their complexity is independent of<br />the order of evaluation.</p><p><br />Keywords: Programming calculi, lambda-calculus, functional programming.</p>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
