当前位置：
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Recursion-free modular arithmetic in the lambda-calculus
Information Processing Letters ( IF 0.5 ) Pub Date : 2023-05-18 , DOI: 10.1016/j.ipl.2023.106408 Maximilien Mackie
更新日期：2023-05-18
Information Processing Letters ( IF 0.5 ) Pub Date : 2023-05-18 , DOI: 10.1016/j.ipl.2023.106408 Maximilien Mackie
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.
京公网安备 11010802027423号