Equations: A dependent pattern-matching compiler

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

Volumn 6172 LNCS, Issue , 2010, Pages 419-434

  Sozeau, Matthieu ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COQ SYSTEMS; DEPENDENT TYPES; INDUCTIVE FAMILIES; PROOF ASSISTANT; RECURSION SCHEMES; TYPE THEORY;

PATTERN MATCHING; PROBLEM SOLVING; PROGRAM COMPILERS; RECURSIVE FUNCTIONS; SAILING VESSELS;

THEOREM PROVING;

EID: 77955240312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14052-5_29     Document Type: Conference Paper

References (15)

1. Goguen, H., McBride, C., McKinna, J.: Eliminating dependent pattern matching. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 521-540. Springer, Heidelberg (2006)
2. Coquand, T.: Pattern Matching with Dependent Types. In: Proceedings of the Workshop on Logical Frameworks (1992)
3. Augustsson, L.: Compiling Pattern Matching. In: FPCA, pp. 368-381 (1985)
4. Barras, B., Corbineau, P., Grégoire, B., Herbelin, H., Sacchini, J.L.: A New Elimination Rule for the Calculus of Inductive Constructions. In: Berardi, S., Damiani, F., de'Liguoro, U. (eds.) TYPES 2008. LNCS, vol. 5497, pp. 32-48. Springer, Heidelberg (2009)
5. Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden (2007)
6. McBride, C.: Elimination with a Motive. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 197-216. Springer, Heidelberg (2002)
7. McBride, C., Goguen, H., McKinna, J.: A Few Constructions on Constructors. Types for Proofs and Programs, 186-200 (2004)
8. Sozeau, M., Oury, N.: First-class type classes. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 278-293. Springer, Heidelberg (2008)
9. Streicher, T.: Semantics of Type Theory. Springer, Heidelberg (1991)
10. Cornes, C.: Conception d'un langage de haut niveau de représentation de preuves: Récurrence par filtrage de motifs, Unification en présesence de types inductifs primitifs, Synthése de lemmes d'inversion. PhD thesis, Université Paris 7 (1997)
11. McBride, C.: Inverting Inductively Defined Relations in LEGO. In: Giménez, E., Paulin-Mohring, C. (eds.) TYPES 1996. LNCS, vol. 1512, pp. 236-253. Springer, Heidelberg (1998)
12. McBride, C., McKinna, J.: The view from the left. J. Funct. Program. 14, 69-111 (2004)
13. Barthe, G., Forest, J., Pichardie, D., Rusu, V.: Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant. Functional and Logic Programming, 114-129 (2006)
14. Bove, A., Capretta, V.: Modelling general recursion in type theory. Mathematical Structures in Computer Science 15, 671-708 (2005)
15. Sozeau, M.: Un environnement pour la programmation avec types dépendants. PhD thesis, Université Paris 11, Orsay, France (2008)