Exploring the regular tree types

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

Volumn 3839 LNCS, Issue , 2006, Pages 252-267

  Morris, Peter ^a   Altenkirch, Thorsten ^a   McBride, Conor ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EPIGRAM LANGUAGE; GENERIC PROGRAMMING; PARTIAL DERIVATIVE; TREE TYPES;

COMPUTER PROGRAMMING; COMPUTER SIMULATION; DECISION THEORY; FORMAL LANGUAGES; MAP SYMBOLS; MATHEMATICAL MODELS; PARTIAL DIFFERENTIAL EQUATIONS;

TREES (MATHEMATICS);

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

References (34)

1. Michael Abbott. Categories of Containers. PhD thesis, University of Leicester, 2003.
2. Michael Abbott, Thorsten Altenkirch, and Neil Ghani. Categories of containers. In Proceedings of Foundations of Software Science and Computation Structures, 2003.
3. Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor McBride. ∂ for data: derivatives of data structures. Fundamenta Informaticae, 65(1,2):1-128, March 2005.
4. 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.
5. Thorsten Altenkirch and Bernhard Reus. Monadic presentations of lambda-terms using generalized inductive types. In Computer Science Logic 1999, 1999.
6. Roland Backhouse, Patrik Jansson, Johan Jeuring, and Lambert Meertens. Generic Programming - An Introduction. In S. Doaitse Sweierstra, Pedro R. Henriques, and José N. Oliveira, editors, Advanced Functional Programming, Third International Summer School (AFP '98); Braga, Portugal, volume 1608 of LNCS, pages 28-115. Springer-Verlag, 1998.
7. 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.
8. Edwin Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005.
9. 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.
10. Dave Clarke, Ralf Hinze, Johan Jeuring, Andres Löh, and Jan de Wit. The Generic Haskell user's guide. Technical Report UU-CS-2001-26, Utrecht University, 2001.
11. L'Équipe Coq. The Coq Proof Assistant Reference Manual. http://pauillac.inria.fr/coq/doc/main.html, 2001.
12. Catarina Coquand and Thierry Coquand. Structured Type Theory. In Workshop on Logical Frameworks and Metalanguages, 1999.
13. 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 (Båstad, Sweden), 1992.
14. Nicolas G. de Bruijn, Lambda Calculus notation with nameless dummies: a tool for automatic formula manipulation. Indagationes Mathematics, 34:381-392, 1972.
15. Nicolas G. de Bruijn. Telescopic Mappings in Typed Lambda-Calculus. Information and Computation, 91:189-204, 1991.
16. 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.
17. Peter Dybjer and Anton Setzer. Indexed induction-recursion. In Reinhard Kahle, Peter Schroeder-Heister, and Robert F. Stärk, editors, Proof Theory in Computer Science, volume 2183 of Lecture Notes in Computer Science, pages 93-113. Springer, 2001.
18. Ralf Hinze, Johan Jeuring, and Andres Löh. Type-indexed data types. Science of Computer Programmming, 51:117-151, 2004.
19. Haruo Hosoya, Jérôme Vouillon, and Benjamin C. Pierce. Regular Expression Types for XML. In Proceedings of the International Conference on Functional Programming, 2000.
20. Gérard Huet. The Zipper. Journal of Functional Programming, 7(5):549-554, 1997.
21. Patrik Jansson and Johan Jeuring. Poly P - a polytypic programming language extension. In Proceedings of POPL '97, pages 470-482, ACM, 1997.
22. Gottfried Leibniz. Nova methodus pro maximis et minimis, itemque tangentibus, qua nee irrationals quantitates moratur. Acta eruditorum, 1684.
23. Zhaohui Luo, Computation and Reasoning; A Type Theory for Computer Science, Oxford University Press, 1994.
24. 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.
25. Lena Magnusson and Bengt Nordström. The ALP 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.
26. Per Martin-Löf. Intuitionistic Type Theory, Bibliopolis-Napoli, 1984.
27. Conor McBride. The Derivative of a Regular Type is its Type of One-Hole Contexts. Available at http://www.dur.ac.uk/c.t.mcbrida/diff.ps, 2001.
28. 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.
29. 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.
30. Conor McBride and James McKinna, The view from the left. Journal of Functional Programming, 14(1), 2004.
31. Fred McBride. Computer Aided Manipulation of Symbols. PhD thesis, Queen's University of Belfast, 1970.
32. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen, The Definition of Standard ML, revised edition. MIT Press, 1997.
33. Holger Pfeifer and Harald Rueß. Polytypic Proof Construction. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Proc. 12th Intl. Conf. on Theorem Proving in Higher Order Logics, number 1690 in Lecture Notes in Computer Science, pages 55-72. Springer-Verlag, September 1999.
34. Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löfs type theory: an introduction. Oxford University Press, 1990.