Eliminating dependent pattern matching

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

Volumn 4060 LNCS, Issue , 2006, Pages 521-540

  Goguen, Healfdene ^a   McBride, Conor ^b   McKinna, James ^c  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^c UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS; RECURSIVE FUNCTIONS;

FUNCTIONAL PROGRAMMING LANGUAGES; REDUCTION-PRESERVING TRANSLATION;

PATTERN MATCHING;

EID: 34548334317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780274_27     Document Type: Conference Paper

References (23)

1. Lennart Augustsson. Compiling Pattern Matching. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of LNCS, pages 368-381. Springer-Verlag, 1985.
2. Edwin Brady, Conor McBride, and James McKinna. Inductive families need not store their indices. In Stefano Berardi, Mario Coppo, and Ferrucio Damiani, editors, Types for Proofs and Programs, Torino, 2003, volume 3085 of LNCS, pages 115-129. Springer-Verlag, 2004.
3. Rod Burstall. Proving properties of programs by structural induction. Computer Journal, 12(1):41-48, 1969.
4. Thierry Coquand. Pattern Matching with Dependent Types. In Bengt Nordström, Kent Petersson, and Gordon Plotkin, editors, Electronic Proceedings of the Third Annual BRA Workshop on Logical Frameworks (Bastad, Sweden), 1992.
5. Nicolas G. de Bruijn. Telescopic Mappings in Typed Lambda-Calculus. Information and Computation, 91:189-204, 1991.
6. Peter Dybjer. Inductive Sets and Families in Martin-Löfs Type Theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks. CUP, 1991.
7. Eduardo Giménez. Codifying guarded definitions with recursive schemes. In Peter Dybjer, Bengt Nordstrom, and Jan Smith, editors, Types for Proofs and Programs, '94, volume 996 of LNCS, pages 39-59. Springer-Verlag, 1994.
8. Healfdene Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1994. Available from http://www.lfcs.informatics.ed.ac.uk/reports/94/ ECS-LFCS-94-304/.
9. Martin Hofmann and Thomas Streicher. A groupoid model refutes uniqueness of identity proofs. In Proc. Ninth Annual Symposium on Logic in Computer Science (LICS) (Paris, France), pages 208-212. IEEE Computer Society Press, 1994.
10. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 257-321. MIT Press, 1991.
11. Zhaohui Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
12. 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, 1992.
13. Lena Magnusson and Bengt Nordström. The ALF proof editor and its proof engine. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Programs, LNCS 806. Springer-Verlag, 1994. Selected papers from the Int. Workshop TYPES '93, Nijmegen, May 1993.
14. Per Martin-Löf. A theory of types. Manuscript, 1971.
15. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999. Available from http://www.lfcs.informatics.ed.ac.uk/reports/00/ECS-LFCS-00-419/.
16. Conor McBride. Elimination with a Motive. In Paul Callaghan, Zhaohui Luo, James McKinna, and Robert Pollack, editors, Types for Proofs and Programs (Proceedings of the International Workshop, TYPES'OO), volume 2277 of LNCS. Springer-Verlag, 2002.
17. Conor McBride, Healfdene Goguen, and James McKinna. A few constructions on constructors. In Jean-Christophe Filliâtre, Christine Paulin, and Benjamin Werner, editors, Types for Proofs and Programs, Paris, 2004, LNCS. Springer-Verlag, 2004.
18. Conor McBride and James McKinna. The view from the left. Journal of Functional Programming, 14(1), 2004.
19. Fred McBride. Computer Aided Manipulation of Symbols. PhD thesis, Queen's University of Belfast, 1970.
20. Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löf's type theory: an introduction. Oxford University Press, 1990.
21. Carsten Schürmann and Frank Pfenning. A coverage checking algorithm for LF. In D. Basin and B. Wolff, editors, Proceedings of the Theorem Proving in Higher Order Logics 16th International Conference, volume 2758 of LNCS, pages 120-135, Rome, Italy, September 2003. Springer.
22. Thomas Streicher. Investigations into intensional type theory. Habilitation Thesis, Ludwig Maximilian Universität, 1993.
23. Daria Walukiewicz-Chrzaszcz. Termination of rewriting in the calculus of constructions. J. Fund. Program., 13(2):339-414, 2003.