A few constructions on constructors

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

Volumn 3839 LNCS, Issue , 2006, Pages 186-200

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

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CASE ANALYSIS; INDUCTION PRINCIPLES; INDUCTIVE DATATYPE; STRUCTURAL RECURSION;

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; COMPUTER SCIENCE; DATA REDUCTION; DATA STRUCTURES;

INFORMATION THEORY;

EID: 33745152658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11617990_12     Document Type: Conference Paper

References (28)

1. Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor McBride. ∂ for data: derivatives of data structures. Fundamenta Informaticae, 2005.
2. Thorsten Altenkirch and Conor McBride. Generic programming within dependently typed programming. In Generic Programming, 2003. Proceedings of the IFIP TC2 Working Conference on Generic Programming, Schloss Dagstuhl, July 2002.
3. Marcin Benke, Peter Dybjer, and Patrik Jansson. Universes for generic programs and proofs in dependent type theory. Nordic Journal of Computing, 10:265-269, 2003.
4. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development, Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer-Verlag, 2004.
5. 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.
6. Thierry Coquand. An analysis of Girard's paradox, In Proceedings of the First IEEE Symposium on Logic in Computer Science, Cambridge, Massachusetts, pages 227-236, 1986.
7. 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.
8. Cristina Cornes and Delphine Terrasse. Automating Inversion of Inductive Predicates in Coq. In Types for Proofs and Programs, '95, volume 1158 of LNCS. Springer-Verlag, 1995.
9. Nicolas G. de Bruijn. Telescopic Mappings in Typed Lambda-Calculus. Information and Computation, 91:189-204, 1991.
10. Peter Dybjer. Inductive Sets and Families in Martin-Löf's Type Theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, CUP, 1991.
11. Eduardo Giménez. Codifying guarded definitions with recursive schemes. In Peter Dybjer, Bengt Nordström, and Jan Smith, editors, Types for Proofs and Programs, '94, volume 996 of LNCS, pages 39-59. Springer-Verlag, 1994.
12. Eduardo Giménez. Structural Recursive Definitions in Type Theory, In Proceedings of ICALP '98, volume 1443 of LNCS. Springer-Verlag, 1998.
13. 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/.
14. Robert Harper and Randy Pollack. Type checking with universes. Theoretical Computer Science, 89:107-136, 1991.
15. Ralf Hinze, Johan Jeuring, and Andres Löh. Type-indexed data types. Science of Computer Programmming, 51:117-151, 2004.
16. 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.
17. Gérard Huet. The Zipper. Journal of Functional Programming, 7(5):549-554, 1997.
18. Zhaohui Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
19. 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.
20. Conor McBride. Inverting inductively defined relations in LEGO. In E. Giménez and C. Paulin-Mohring, editors, Types for Proofs and Programs, '96, volume 1512 of LNCS, pages 236-253. Springer-Verlag, 1998.
21. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999. Available from http://wvw.lfcs. informatics.ed.ac.uk/reports/00/ECS-LFCS-00-419/.
22. 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'00), volume 2277 of LNCS. Springer-Verlag, 2002.
23. Conor McBride. Epigram: Practical programming with dependent types. In Varmo Vene and Tarmo Uustalu, editors, Advanced Functional Programming 2004, Lecture Notes in Computer Science. Springer-Verlag, 2005+. Revised lecture notes from the International Summer School in Tartu, Estonia.
24. Conor McBride and James McKinna. Functional Pearl: I am not a Number: I am a Free Variable, In Henrik Nilsson, editor, Proceedings of the ACM SIGPLAN Haskell Workshop 2004, Snowbird, Utah. ACM, 2004.
25. Conor McBride and James McKinna. The view from the left. Journal of Functional Programming, 14(1), 2004.
26. Christine Paulin-Mohring. Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation Thesis. Université Claude Bernard (Lyon I), 1996.
27. Jan Smith. The Independence of Peano's Fourth Axiom from Martin-Löf's Type Theory without Universes. Journal of Symbolic Logic, 53(3), 1983.
28. Thomas Streicher. Investigations into intensional type theory. Habilitation Thesis, Ludwig Maximilian Universität, 1993.