Outrageous but meaningful coincidences: Dependent type-safe syntax and evaluation

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2010, Pages 1-12

  McBride, Conor ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

dependent types; generic programming

Indexed keywords

ALGEBRAIC DATA-TYPES; DATA TYPE; DEPENDENT TYPES; GENERIC PROGRAMMING; KEY COMPONENT; MEANINGFUL COINCIDENCES; PRECISE INDEXING; TYPE EQUALITY;

EID: 78449250633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1863495.1863497     Document Type: Conference Paper

References (45)

1. T. Altenkirch and C. McBride. Generic programming within dependently typed programming. In J. Gibbons and J. Jeuring, editors, Generic Programming, volume 243 of IFIP Conference Proceedings, pages 1-20. Kluwer, 2002.
2. T. Altenkirch and B. Reus. Monadic presentations of lambda terms using generalized inductive types. In J. Flum and M. Rodríguez-Artalejo, editors, CSL, volume 1683 of LNCS, pages 453-468. Springer, 1999.
3. T. Altenkirch, C. McBride, and W. Swierstra. Observational equality, now! In A. Stump and H. Xi, editors, PLPV, pages 57-68. ACM, 2007.
4. L. Augustsson and M. Carlsson. An exercise in dependent types: A well-typed interpreter. Available at http://www.cs.chalmers.se/~augustss/ cayenne/interp.ps, 1999.
5. A. I. Baars and S. D. Swierstra. Type-safe, self inspecting code. In Haskell '04: Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, pages 69-79, New York, NY, USA, 2004. ACM. doi: http://doi.acm.org/10.1145/1017472. 1017485.
6. B. Barras. Coq en coq. Rapport de Recherche 3026, INRIA, Oct. 1996.
7. B. Barras. Auto-validation d'un système de preuves avec familles inductives. Thèse de doctorat, Université Paris 7, Nov. 1999.
8. B. Barras and B. Werner. Coq in coq. http://pauillac.inria.fr/ barras/coqincoq.ps.gz, 1997.
9. N. Benton, C.-K. Hur, A. Kennedy, and C. McBride. Strongly Typed Term Representations in Coq. J. of Automated Reasoning, 2010. To appear.
10. E. Brady and K. Hammond. A verified staged interpreter is a verified compiler. In S. Jarzabek, D. C. Schmidt, and T. L. Veldhuizen, editors, GPCE, pages 111-120. ACM, 2006.
11. E. Brady and K. Hammond. Scrapping your Inefficient Engine: using Partial Evaluation to Improve Domain-Specific Language Implementation,. In ICFP 2010. ACM, 2010. To appear.
12. J. Carette, O. Kiselyov, and C.-C. Shan. Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages. J. Funct. Program., 19(5):509-543, 2009.
13. J. Chapman. Type theory should eat itself. Electr. Notes Theor. Comput. Sci., 228:21-36, 2009.
14. J. Chapman. Type checking and normalisation. PhD thesis, University of Nottingham, 2008.
15. J. Chapman, P. Dagand, C. McBride, and P. Morris. The Gentle Art of Levitation. In ICFP 2010. ACM, 2010. To appear.
16. C. Chen and H. Xi. Meta-programming through typeful code representation. In C. Runciman and O. Shivers, editors, ICFP 2003, pages 275-286. ACM, 2003.
17. K. Crary, S. Weirich, and J. G. Morrisett. Intensional polymorphism in type-erasure semantics. In ICFP 1998, pages 301-312, 1998.
18. H. B. Curry and R. Feys. Combinatory Logic Volume I. Studies in Logic. North-Holland, 1958.
19. L. Damas and R. Milner. Principal type-schemes for functional programming languages. In POPL 1982, pages 207-212. ACM, 1982.
20. N. A. Danielsson. A formalisation of a dependently typed language as an inductive-recursive family. In T. Altenkirch and C. McBride, editors, TYPES, volume 4502 of LNCS, pages 93-109. Springer, 2006.
21. N. G. de Bruijn. Lambda Calculus notation with nameless dummies: a tool for automatic formula manipulation. Indagationes Mathematicæ, 34:381-392, 1972.
22. N. G. de Bruijn. Telescopic Mappings in Typed Lambda-Calculus. Information and Computation, 91:189-204, 1991.
23. P. Dybjer. Inductive Sets and Families in Martin-Löf's Type Theory. In G. Huet and G. Plotkin, editors, Logical Frameworks. CUP, 1991.
24. P. Dybjer and A. Setzer. Indexed induction-recursion. In R. Kahle, P. Schroeder-Heister, and R. F. Stärk, editors, Proof Theory in Computer Science, volume 2183 of LNCS, pages 93-113. Springer, 2001.
25. P. Dybjer and A. Setzer. A finite axiomatization of inductive-recursive definitions. In J.-Y. Girard, editor, TLCA 1999, volume 1581 of LNCS, pages 129-146. Springer, 1999.
26. F. Forsberg and A. Setzer. Inductive-inductive definitions. In CSL 2010. Springer, 2010.
27. R. Harper, F. Honsell, and G. D. Plotkin. A framework for defining logics. J. ACM, 40(1):143-184, 1993.
28. G. Huet and G. Plotkin, editors. Electronic Proceedings of the First Annual BRA Workshop on Logical Frameworks (Antibes, France), 1990.
29. G. P. Huet. A unification algorithm for typed lambda-calculus. Theor. Comput. Sci., 1(1):27-57, 1975.
30. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis•Napoli, 1984.
31. C. McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
32. C. McBride and R. Paterson. Applicative programming with effects. J. Funct. Program., 18(1):1-13, 2008.
33. J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. F. Groote, editors, TLCA, volume 664 of LNCS, pages 289-305. Springer, 1993.
34. J. McKinna and R. Pollack. Some lambda calculus and type theory formalized. J. Autom. Reasoning, 23(3-4):373-409, 1999.
35. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Log. Comput., 1(4):497-536, 1991.
36. U. Norell. Dependently typed programming in agda. In P. W. M. Koopman, R. Plasmeijer, and S. D. Swierstra, editors, Advanced Functional Programming, volume 5832 of LNCS, pages 230-266. Springer, 2008.
37. U. Norell. Towards a Practical Programming Language based on Dependent Type Theory. PhD thesis, Chalmers University of Technology, 2007.
38. E. Palmgren. On universes in type theory. In Proceedings of the meeting Twenty-five years of constructive type theory. OUP, 1998.
39. E. Pasalic, W. Taha, and T. Sheard. Tagless staged interpreters for typed languages. In ICFP 2002, pages 218-229, 2002.
40. C. Paulin-Mohring. Définitions inductives en théorie des types d'ordre supérieur. thèse d'habilitation, ENS Lyon, 1996.
41. B. C. Pierce and D. N. Turner. Local type inference. In POPL 1998, pages 252-265, 1998.
42. R. Pollack. Dependently typed records in type theory. Formal Asp. Comput., 13(3-5):386-402, 2002.
43. R. Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, Univ. of Edinburgh, 1994. URL http://homepages.inf.ed.ac.uk/rpollack/export/thesis.ps.gz.
44. R. Pollack. Implicit syntax. URL ftp://ftp.dcs.ed.ac.uk/pub/lego/ ImplicitSyntax.ps.Z. An earlier version appeared in [Huet and Plotkin 1990], 1992.
45. W. Verbruggen, E. de Vries, and A. Hughes. Polytypic properties and proofs in Coq. In WGP, 2009.