A new elimination rule for the calculus of inductive constructions

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

Volumn 5497 LNCS, Issue , 2009, Pages 32-48

  Barras, Bruno ^a   Corbineau, Pierre ^b   Grégoire, Benjamin ^c   Herbelin, Hugo ^a   Sacchini, Jorge Luis ^c  

^a INRIA SACLAY   (France)

^b UNIV GRENOBLE ALPES   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULUS OF INDUCTIVE CONSTRUCTIONS; CASE ANALYSIS; COQ PROOF ASSISTANT; COQ SYSTEMS; ELIMINATION RULES; PATTERN-MATCHING; RELATIVE CONSISTENCY; SEMANTIC APPROACH; SUBJECT REDUCTION; SYNTACTIC APPROACH; TYPE THEORY;

SYNTACTICS;

EID: 68749106132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02444-3_3     Document Type: Conference Paper

References (13)

1. The Coq Development Team. The Coq Reference Manual, version 8.1. Distributed electronically (February 2007), http://coq.inria.fr/doc
2. Coquand, T.: Pattern matching with dependent types. In: Nordström, B., Petersson, K., Plotkin, G. (eds.) Informal Proceedings Workshop on Types for Proofs and Programs, Båstad, Sweden (1992)
3. 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)
4. Hofmann, M., Streicher, T.: The groupoid model refutes uniqueness of identity proofs. In: LICS, pp. 208-212. IEEE Computer Society, Los Alamitos (1994)
5. McBride, C.: Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh (1999)
6. McBride, C.: Epigram: Practical programming with dependent types. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol. 3622, pp. 130-170. Springer, Heidelberg (2005)
7. McBride, C., McKinna, J.: The view from the left. J. Funct. Program. 14(1), 69-111 (2004)
8. Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)
9. Oury, N.: Pattern matching coverage checking with dependent types using set approximations. In: Stump, A., Xi, H. (eds.) PLPV, pp. 47-56. ACM, New York (2007)
10. Paulin-Mohring, C.: Inductive definitions in the system Coq - rules and properties. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 328-345. Springer, Heidelberg (1993)
11. Schürmann, C., Pfenning, F.: A coverage checking algorithm for LF. In: Basin, D.A., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 120-135. Springer, Heidelberg (2003)
12. Sozeau, M.: Subset coercions in coq. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 237-252. Springer, Heidelberg (2007)
13. Werner, B.: Une Théorie des Constructions Inductives. PhD thesis, UniversitéParis 7 (1994)