Skip to main content Accessibility help
×
Home
Hostname: page-component-768dbb666b-x9ds4 Total loading time: 0.246 Render date: 2023-02-05T12:38:17.428Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Compact numeral representation with combinators

Published online by Cambridge University Press:  12 March 2014

E. V. Krishnamurthy
Affiliation:
Computer Science Department, University of Waikato, Hamilton, New Zealand
B. P. Vickers
Affiliation:
Computer Science Department, University of Waikato, Hamilton, New Zealand

Abstract

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.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Curry, H. B., Hindley, R. and Seldin, J., Combinatory logic. Vol. 2, North-Holland, Amsterdam, 1972.Google Scholar
[2]Curry, H. B. and Feys, R., Combinatory logic. Vol. 1, North-Holland, Amsterdam, 1958.Google Scholar
[3]Wadsworth, C. P., Some unusual λ-calculus numeral systems, To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism (Seldin, J. P. and Hindley, J. R., editors), Academic Press, New York, 1980, pp. 215230.Google Scholar
[4]Böhm, C., An abstract approach to (hereditary) finite sequences of comhinators, To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism (Seldin, J. P. and Hindley, J. R., editors), Academic Press, New York, 1980, pp. 231242.Google Scholar
[5]McCarthy, J., Recursive functions of symbolic expressions and their computation by machine, Communications of the Association for Computing Machinery, vol. 7 (1960), pp. 184195.CrossRefGoogle Scholar
[6]Krishnamurthy, E. V., Introductory theory of computer science, Macmillan, New York, 1983.CrossRefGoogle Scholar
[7]Corcoran, J., Frank, W. and Maloney, M., String theory, this Journal, vol. 39 (1974), pp. 625637.Google Scholar
[8]Church, A., A set of postulates for the foundation of logic, Annals of Mathematics, ser. 2, vol. 33 (1932), pp. 346366.CrossRefGoogle Scholar
1
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Compact numeral representation with combinators
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Compact numeral representation with combinators
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Compact numeral representation with combinators
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *