论文信息 - Compact Numeral Representation with Combinators

Compact Numeral Representation with Combinators

This paper is concerned with the combinator representation of numeral systems with logarithmic space complexity of symbols. The principle used is based on the lexicographic ordering of words over a finite alphabet.

E. V. Krishnamurthy | B. P. Vickers

[1] A. Church. A Set of Postulates for the Foundation of Logic , 1932 .

[2] J. Roger Hindley,et al. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[3] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[4] E V. Krishnamurthy. Introductory theory of computer science , 1983 .