Hostname: page-component-76c49bb84f-7l7zb Total loading time: 0 Render date: 2025-07-11T20:25:54.861Z Has data issue: false hasContentIssue false
  • English
  • Français

Folding left and right over Peano numbers

Part of: JFP Functional Pearls

Published online by Cambridge University Press:  17 April 2019

OLIVIER DANVY
OLIVIER DANVY*
Affiliation:
Yale-NUS College and School of Computing, National University of Singapore, Singapore (e-mail: danvy@acm.org)
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Functional Pearl
Information
Journal of Functional Programming , Volume 29 , 2019 , e6
Copyright
© Cambridge University Press 2019 

References

Bertot, Y. & Castéran, P. (2004) Interactive Theorem Proving and Program Development. Springer.CrossRefGoogle Scholar
Bird, R. & Wadler, P. (1988) Introduction to Functional Programming, 1st ed. London, UK: Prentice-Hall International.Google Scholar
Burstall, R. M. & Darlington, J. (1977) A transformational system for developing recursive programs. J. ACM 24(1), 44–67.CrossRefGoogle Scholar
Church, A. (1941) The Calculi of Lambda-Conversion. Princeton University Press.Google Scholar
Danvy, O. & Spivey, M. (2007) On Barron and Strachey’s Cartesian product function, possibly the world’s first functional pearl. In Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming (ICFP’07), Hinze, R. & Ramsey, N. (eds). SIGPLAN Notices, vol. 42, no. 9. Freiburg, Germany: ACM Press, pp. 41–46.CrossRefGoogle Scholar
Goldberg, M. (1996) Recursive Application Survival in the λ-calculus. PhD Thesis, Computer Science Department, Indiana University, Bloomington, Indiana.Google Scholar
Goldberg, M. (2014) The λ Calculus – Outline of Lectures. lambda.little-lisper.org. Google Scholar
Gordon, M. J. C. (1979) On the power of list iteration. Comput. J. 22(4), 376–379.CrossRefGoogle Scholar
Hughes, J. (1986) A novel representation of lists and its application to the function “reverse”. Inf. Process. Lett. 22(3), 141–144.CrossRefGoogle Scholar
Johnsson, T. (1985) Lambda lifting: Transforming programs to recursive equations. In Functional Programming Languages and Computer Architecture, Jouannaud, J.-P. (ed). Lecture Notes in Computer Science, vol. 201. Nancy, France: Springer-Verlag, pp. 190–203.CrossRefGoogle Scholar
Kleene, S. C. (1981) Origins of recursive function theory. Ann. Hist. Comput. 3(1), 52–67.CrossRefGoogle Scholar
Meertens, L. (1992) Paramorphisms. Formal Aspects Comput. 4(5), 413–424.CrossRefGoogle Scholar
Ohori, A. & Sasano, I. (2007) Lightweight fusion by fixed point promotion. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages, Felleisen, M. (ed). SIGPLAN Notices, vol. 42, no. 1. Nice, France: ACM Press, pp. 143–154.Google Scholar
Strachey, C. (1961) Handwritten Notes. Archive of Working Papers and Correspondence. Bodleian Library, Oxford, Catalogue no. MS. Eng. misc. b.267.Google Scholar
Wadler, P. (1984) Listlessness is better than laziness. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, Steele, G. L. (ed). Austin, Texas: ACM Press, pp. 282–305.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.