Recursive functions with higher order domains

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 116-130

  Bove, Ana ^a   Capretta, Venanzio ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRUCTIVE TYPE THEORY; FUNCTIONAL PROGRAMMING; IMPREDICATIVE TYPE THEORY; Λ-ABSTRACTIONS;

RECURSIVE FUNCTIONS;

EID: 24944561982     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_10     Document Type: Conference Paper

References (16)

1. [BC01] A. Bove and V. Capretta. Nested general recursion and partiality in type theory. In R. J. Boulton and P. B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, volume 2152 of Lecture Notes in Computer Science, Springer-Verlag, pages 121-135, September 2001.
2. [BC04] A. Bove and V. Capretta. Modelling general recursion in type theory. To appear in Mathematical Structures in Computer Science. Available on the WWW: http://www.cs.chalmers.se/~bove/Papers/ general_presentation.ps.gz, May 2004.
3. [Bla03] Frédéric Blanqui. Inductive types in the calculus of algebraic constructions. In M. Hofmann, editor, Typed Lambda Calculi and Applications: 6th International Conference, TLCA 2003, volume 2701 of LNCS, pages 46-59. Springer-Verlag, 2003.
4. [Bov01] A. Bove. Simple general recursion in type theory. Nordic Journal of Computing, 8(1):22-42, Spring 2001.
5. [Bov02a] A. Bove. Mutual general recursion in type theory. Technical Report, Chalmers University of Technology. Available on the WWW: http:// www.cs.chalmers.se/~bove/Papers/mutual_rec.ps.gz, May 2002.
6. [Bov02b] Ana Bove. General Recursion in Type Theory. PhD thesis, Chalmers University of Technology, Department of Computing Science, November 2002. Available on the WWW: http://cs.chalmers.se/~bove/ Papers/phd_thesis.ps.gz.
7. [Bov03] A. Bove. General recursion in type theory. In H. Geuvers and F. Wiedijk, editors, Types for Proofs and Programs, International Workshop TYPES 2002, The Netherlands, number 2646 in Lecture Notes in Computer Science, pages 39-58, March 2003.
8. [Cap04] Venanzio Capretta. A polymorphic representation of induction-recursion. Draft paper. Available from http://www.science.uottawa. ca/~vcapr396/, 2004.
9. [CH88] T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76:95-120, 1988.
10. [CM85] R. L. Constable and N. P. Mendler. Recursive definitions in type theory. In Rohit Parikh, editor, Logic of Programs, volume 193 of Lecture Notes in Computer Science, pages 61-78. Springer, 1985.
11. [Coq02] Coq Development Team. LogiCal Project. The Coq Proof Assistant. Reference Manual. Version 7.4. INRIA, 2002.
12. [DDG98] C. Dubois and V. Viguié Donzeau-Gouge. A step towards the mechanization of partial functions: Domains as inductive predicates. In M. Kerber, editor, CADE-15, The 15th International Conference on Automated Deduction, pages 53-62, July 1998. WORKSHOP Mechanization of Partial Functions.
13. [Dyb00] P. Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, 65(2), June 2000.
14. [FFL97] S. Finn, M.P. Fourman, and J. Longley. Partial functions in a total setting. Journal of Automated Reasoning, 18(1):85-104, 1997.
15. [Jon03] S. Peyton Jones, editor. Haskell 98 Language and Libraries. The Revised Report. Cambridge University Press, April 2003.
16. [Pau] Christine Paulin. How widely applicable is Coq? Contribution to the Coq mailing list, 19 Aug 2002, http://pauillac.inria.fr/bin/ wilma_hiliter/coq-club/200208/msg00003.html.