Epigram: Practical programming with dependent types

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

Volumn 3622 LNCS, Issue , 2005, Pages 130-170

  McBride, Conor ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646050060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546382_3     Document Type: Conference Paper

References (40)

1. Andreas Abel and Thorsten Altenkirch. A predicative analysis of structural recursion. Journal of Functional Programming, 2000.
2. Thorsten Altenkirch and Bernhard Reus. Monadic presentations of lambda-terms using generalized inductive types. In Computer Science Logic 1999, 1999.
3. 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.
4. Lennart Augustsson. Cayenne-a language with dependent types. In ACM International Conference on Functional Programming '98. ACM, 1998.
5. Lennart Augustsson and Magnus Carlsson. An exercise in dependent types: A well-typed interpreter. Available at http://www.cs.chalmers.se/ augustss/cayenne/interp.ps, 1999.
6. Françoise Bellegarde and James Hook. Substitution: A formal methods case study using monads and transformations. Science of Computer Programming, 1995.
7. 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.
8. Richard Bird and Oege de Moor. Algebra of Programming. Prentice Hall, 1997.
9. Richard Bird and Ross Paterson. de Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1):77-92, 1999.
10. Edwin Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005.
11. L'Equipe 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. Peter Dybjer. Inductive Sets and Families in Martin-Löfs Type Theory. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks. CUP, 1991.
16. Daniel Fridlender and Mia Indrika. Do we need dependent types? Journal of Functional Programming, 10(4):409-415, 2000.
17. 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.
18. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. A CM SIGPLAN Notices, 38(3):26-37, March 2003. Proc. of the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003).
19. Zhaohui Luo. Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, 1994.
20. 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.
21. 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.
22. Per Martin-Lof. A theory of types, manuscript, 1971.
23. 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/.
24. Conor McBride. Faking It (Simulating Dependent Types in Haskell). Journal of Functional Programming, 12(4& 5):375-392, 2002. Special Issue on Haskell.
25. Conor McBride. First-Order Unification by Structural Recursion. Journal of Functional Programming, 13(6), 2003.
26. Conor McBride. Epigram, 2004. http://www.dur.ac.uk/CARG/epigram.
27. Conor McBride and James McKinna. The view from the left. Journal of Functional Programming, 14(1), 2004.
28. Fred McBride. Computer Aided Manipulation of Symbols. PhD thesis, Queen's University of Belfast, 1970.
29. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML, revised edition. MIT Press, 1997.
30. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
31. Chris Okasaki. From Fast Exponentiation to Square Matrices: An Adventure in Types, In ACM International Conference on Functional Programming '99, 1999.
32. Simon Peyton Jones and John Hughes, editors. Haskell'98: A Non-Strict Functional Language, 1999, Available from http://www.haskell.org/definition.
33. Simon Peyton Jones, Geoffrey Washburn, and Stephanie Weirich. Wobbly types: type inference for generalised algebraic data types. Unpublished, 2004.
34. Dag Prawitz, Natural Deduction - A proof theoretical study, Almquist and Wiksell, Stockholm, 1965.
35. Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löfs type theory: an introduction. Oxford University Press, 1990.
36. Alan Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM, 12:23-41, 1965.
37. David Turner. Elementary Strong Functional Programming. In Functional Programming Languages in Education, First International Symposium, volume 1022 of LNCS. Springer-Verlag, 1995.
38. Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In Proceedings of POPL '87. ACM, 1987.
39. Hongwei Xi. Dependent Types in Practical Programming. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University, 1998.
40. Hongwei Xi and Frank Pfenning. Eliminating array bound checking through dependent types. In Proceedings of the Conference on Programming Language Design and Implementation (PLDI'98). ACM Press, 1998.