Church numerals, twice!

Journal of Functional Programming

Volumn 15, Issue 1, 2005, Pages 1-13

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHURCH NUMERALS; EXPONENTIATION; FUNCTIONAL PROGRAMMING; PEANO NUMERALS;

ALGEBRA; COMPUTATIONAL METHODS; ENCODING (SYMBOLS); NUMBER THEORY; RECURSIVE FUNCTIONS; THEOREM PROVING;

COMPUTER PROGRAMMING;

EID: 11444265162     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796804005313     Document Type: Article

References (21)

1. Barendregt, H. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. (eds.), Handbook of Logic in Computer Science, Volume 2, Background: Computational Structures, pp. 118-309. Clarendon Press, Oxford.
2. Bird, R. and de Moor, O. (1997) Algebra of Programming. Prentice Hall Europe.
3. Böhm, C. and Berarducci, A. (1985) Automatic synthesis of typed λ-programs on term algebras. Theor. Comput. Sci. 39(2-3), 135-154.
4. Church, A. (1941) The Calculi of Lambda-Conversion. Annals of Mathematics Studies No. 6, Princeton University Press.
5. Dershowitz, N. and Jouannaud, J.-P. (1990) Rewrite systems. In: van Leeuwen, J. (ed.), Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 243-320. Elsevier.
6. Gill, A., Launchbury, J. and Peyton Jones, S. L. (1993) A short cut to deforestation. FPCA '93: The Sixth International Conference on Functional Programming Languages and Computer Architecture, pp. 223-232. ACM Press.
7. Girard, J.-Y. (1972) Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII.
8. Hinze, R. (2000) Deriving backtracking monad transformers. In: Wadler, P. (ed.), Proceedings 2000 International Conference on Functional Programming, pp. 186-197. Montreal, Canada.
9. Hinze, R. (2001) Prolog's control constructs in a functional setting - Axioms and implementation. Int. J. Foundations of Comput. Sci. 12(2), 125-170.
10. Hughes, J. (1995) The design of a pretty-printing library. In: Jeuring, J. and Meijer, E. (eds.), Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques: Lecture Notes in Computer Science 925, pp. 53-96. Båstad, Sweden. Springer-Verlag.
11. Hughes, R. J. M. (1986) A novel representation of lists and its application to the function "reverse". Infor. Process. Lett. 22(3), 141-144.
12. Hutton, G. (1999) A tutorial on the universality and expressiveness of fold. J. Funct. Program. 9(4), 355-372.
13. Leivant, D. (1983) Reasoning about functional programs and complexity classes associated with type disciplines. Proceedings 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83, pp. 460-469. Tucson, AZ. IEEE Press.
14. Mendler, N. P. (1991) Inductive types and type constraints in the second-order lambda calculus. Ann. Pure & Appl. Logic, 51(1-2), 159-172.
15. Moggi, E. (1991) Notions of computation and monads. Infor. & Computation 93(1), 55-92.
16. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
17. Parigot, M. (1992) Recursive programming with proofs. Theor. Comput. Sci. 94(2), 335-356.
18. Reynolds, J. (1974) Towards a theory of type structure. Proceedings, Colloque sur la Programmation: Lecture Notes in Computer Science 19, pp. 408-425. Springer-Verlag.
19. Takano, A. and Meijer, E. (1995) Shortcut deforestation in calculational form. Proceedings Seventh International Conference on Functional Programming Languages and Computer Architecture (FPCA'95), pp. 306-313. La Jolla, San Diego, CA. ACM Press.
20. Wadler, P. (1989) Theorems for free! Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), pp. 347-359. London, UK. Addison-Wesley.
21. Wadler, P. (1990) Comprehending monads. Proceedings 1990 ACM Conference on LISP and Functional Programming, pp. 61-78. Nice, France. ACM Press.