Elimination with a motive

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

Volumn 2277 LNCS, Issue , 2002, Pages 197-216

  McBride, Conor ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GROUP THEORY; ARTIFICIAL INTELLIGENCE; COMPUTERS;

DATATYPES; ELIMINATION RULES; INDUCTION PRINCIPLES; INTERACTIVE PROOFS; SUB-PROBLEMS;

THEOREM PROVING;

EID: 84864615942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45842-5_13     Document Type: Conference Paper

References (24)

1. Thorsten Altenkirch. Extensional equality in intensional type theory. In LICS'99, 1999.
2. Alan Bundy. The Automation Of Proof By Mathematical Induction. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science, 1999.
3. L'équipe Coq. The Coq Proof Assistant Reference Manual. http://pauillac.inria.fr/coq/doc/main.html, Apr 2001.
4. Thierry Coquand. Pattern Matching with Dependent Types. In Proceedings of the Logical Framework workshop at Båstad, June 1992.
5. Thierry Coquand and Christine Paulin. Inductively defined types. In P. Martin-Löf and G. Mints, editors, COLOG-88. International Conference on Computer Logic, LNCS 417, pages 50-66. Springer-Verlag, 1990.
6. Cristina Cornes. Conception d'un langage de haut niveau de répresenatation de preuves. PhD thesis, Université Paris VII, 1997.
7. Cristina Cornes and Delphine Terrasse. Inverting Inductive Predicates in Coq. In Types for Proofs and Programs'95, LNCS 1158, Springer-Verlag, 1995.
8. N.G. de Bruijn. Telescopic Mappings in Typed Lambda-Calculus. Information and Computation, 91:189-204, 1991.
9. Peter Dybjer. Inductive Sets and Families inMartin-Löf's Type Theory. In G. Huet and G. Plotkin, editors, Logical Frameworks. CUP, 1991.
10. Martin Hofmann. Extensional concepts in intensional type theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1995.
11. Zhaohui Luo and Robert Pollack. LEGO Proof Development System: User's Manual. Technical Report ECS-LFCS-92-211, Laboratory for Foundations of Computer Science, University of Edinburgh, May 1992.
12. Lena Magnusson. The implementation of ALF-A Proof Editor based on Martin-Löf 's Monomorphic Type Theory with Explicit Substitutiton. PhD thesis, Chalmers University of Technology, Göteborg, 1994.
13. Per Martin-Löf. A theory of types. manuscript, 1971.
14. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis-Napoli, 1984.
15. Conor McBride. Inverting inductively defined relations in LEGO. In E. Giménez and C. Paulin-Mohring, editors, Types for Proofs and Programs'96, LNCS 1512, pages 236-253, Springer-Verlag, 1998.
16. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
17. J. McKinna. Deliverables: A Categorical Approach to Program Development in Type Theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1992.
18. Dale Miller. A Logic Programming Language with Lambda-Abstraction, Function Variables and Simple Unification. Journal of Logic and Computation, 2(4):497-537, 1991.
19. Dale Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14(4):321-358, 1992.
20. Christine Paulin-Mohring. Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation Thesis. Université Claude Bernard (Lyon I), 1996.
21. Robert Pollack. Implicit syntax.
22. Alan Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM, 12:23-41, 1965.
23. Thomas Streicher. Investigations into intensional type theory. Habilitation Thesis, Ludwig Maximilian Universität, 1993.
24. P. Wadler. Views: A way for pattern matching to cohabit with data abstraction. In POPL'87. ACM, 1987.