E-resources
Peer reviewed
Open access
-
Mackie, Maximilien
Information processing letters, January 2024, 2024-01-00, Volume: 183Journal Article
We investigate encodings for modular arithmetic in the lambda-calculus. There are two approaches: adapting well-known numeral systems, and building a new one. This paper focuses on providing original techniques to encode modular arithmetic directly. We present a modular arithmetic numeral system complete with multiplication and an implementation of the Chinese remainder theorem, all without recursion i.e., without using fixed-point operators. •Modular arithmetic has a simple implementation in the lambda-calculus.•The Chinese remainder theorem reduces computational complexity.•The Chinese remainder theorem has a simple implementation using pairs.
