General recursion in type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2646, Issue , 2003, Pages 39-58

  Bove, Ana ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LANGUAGES; FUNCTIONAL PROGRAMMING; TRANSPORTATION;

CONSTRUCTIVE TYPE THEORY; INPUT VALUES; PARTIAL FUNCTIONS; RECURSIONS; RECURSIVE ALGORITHMS; STRUCTURAL RECURSION; TYPE THEORY;

ALGORITHMS;

EID: 35248820187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39185-1_3     Document Type: Article

References (29)

1. A. Abel. Termination checking with types - Strong normalization for Mendler-style course-of-value recursion. Technical Report 0201, Institut für Informatik, Ludwig-Maximilians - Universität München, 2002.
2. P. Aczel. An Introduction to Inductive Definitions. In J. Barwise, editor, Handbook of Mathematical Logic, pages 739-782. North-Holland Publishing Company, 1977.
3. A. Balaa and Y. Bertot. Fix-point equations for well-founded recursion in type theory. In Harrison and Aagaard [HA00], pages 1-16.
4. A. Balaa and Y. Bertot. Fonctions récursives générales par itération en théorie des types. Journées Francophones des Langages Applicalifs - JFLA02, INRIA, January 2002.
5. 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.
6. A. Bove and V. Capretta. Modelling general recursion in type theory, September 2002. Available on the WWW http://cs.chalmers.se/∼bove/Papers/general_presentation.ps.gz.
7. Y. Bertot, V. Capretta, and K. Das Barman. Type-theoretic functional semantics. In Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002, 2002.
8. G. Barthe, M.J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions. Under consideration for publication in Math. Struct. in Comp. Science, December 2000.
9. A. Bove. Programming in Martin-Löf type theory: Unification - A non-trivial example, November 1999. Licentiate Thesis of the Department of Computer Science, Chalmers University of Technology. Available on the WWW http://cs.chalmers.se/∼bove/Papers/lic_thesis.ps.gz.
10. A. Bove. Simple general recursion in type theory. Nordic Journal of Computing, 8(1):22-42, Spring 2001.
11. A. Bove. General Recursion in Type Theory. PhD thesis, Department of Computing Science, Chalmers University of Technology, November 2002. Available on the WWW http://cs.chalmers.se/∼bove/Papers/phd_thesis.ps.gz.
12. A. Bove. Mutual general recursion in type theory, May 2002. Available on the WWW http://cs.chalmers.se/∼bove/Papers/mutual_rec.ps.gz.
13. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76:95-120, 1988.
14. T. Coquand, B. Nordström, J. M. Smith, and B. von Sydow. Type theory and programming. EATCS, 52, February 1994.
15. C. Dubois and V. Viguí 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.
16. P. Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, 65(2), June 2000.
17. S. Finn, M.P. Fourman, and J. Longley. Partial functions in a total setting. Journal of Automated Reasoning, 18(1):85-104, 1997.
18. J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19:1-29, 1997.
19. J. Harrison and M. Aagaard, editors. Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
20. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, London, 1980.
21. S. Peyton Jones, J. Hughes, (editors), L. Augustsson, D. Barton, B. Boutel, W. Burton, J. Fasel, K. Hammond, R. Hinze, P. Hudak, T. Johnsson, M. Jones, J. Launchbury, E. Meijer, J. Peterson, A. Reid, C. Runciman, and P. Wadler. Report on the Programming Language Haskell 98, a Non-strict, Purely Functional Language. Available from http://haskell.org, February 1999.
22. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
23. Z. Manna and J. McCarthy. Properties of programs and partial function logic. Machine Intelligence, 5:27-37, 1970.
24. C. McBride and J. McKinna. The view from the left, 2002. Under consideration for publication in Journal of Functional Programming.
25. B. Nordström. Terminating General Recursion. BIT, 28(3):605-619, October 1988.
26. B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin-Löf's Type Theory. An Introduction. Oxford University Press, 1990.
27. L. C. Paulson. Proving Termination of Normalization Functions for Conditional Expressions. Journal of Automated Reasoning, 2:63-74, 1986.
28. K. Slind. Function definition in higher-order logic. In Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, Turku, Finland, August 1996.
29. K. Slind. Another look at nested recursion. In Harrison and Aagaard [HA00], pages 498-518.