Type Theory Should Eat Itself

Electronic Notes in Theoretical Computer Science

Volumn 228, Issue C, 2009, Pages 21-36

  Chapman, James ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Agda; big step normalisation; explicit substitutions; type theory; typed syntax

Indexed keywords

FUNCTIONAL PROGRAMMING; STRUCTURED PROGRAMMING; SYNTACTICS; TECHNICAL PRESENTATIONS;

AGDA; BIG-STEP NORMALISATION; EXPLICIT SUBSTITUTIONS; TYPE THEORY; TYPED SYNTAX;

COMPUTER PROGRAMMING;

EID: 58149387190     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.12.114     Document Type: Article

References (24)

1. Thorsten Altenkirch and James Chapman. Tait in one big step. In Workshop on Mathematically Structured Functional Programming, MSFP 2006, Kuressaare, Estonia, July 2, 2006, electronic Workshop in Computing (eWiC), Kuressaare, Estonia, 2006. The British Computer Society (BCS)
2. Thorsten Altenkirch and James Chapman. Big-Step Normalisation. Journal of Functional Programming, 2008. Special Issue on Mathematically Structured Functional Programming. To appear
3. Andreas Abel, Thierry Coquand, and Peter Dybjer. Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory. In Mathematics of Program Construction, MPC'08, 2008. To appear
4. Bove A., and Capretta V. Nested General Recursion and Partiality in Type Theory. In: Boulton R., and Jackson P. (Eds). Theorem Proving in Higher Order Logics. TPHOLs 2001. Lecture Notes in Computer Science volume 2152 (September 2001), Springer-Verlag
5. Buisse A., and Dybjer P. Towards formalizing categorical models of type theory in type theory. Proc. Int. Workshop on Logical Frameworks and Meta-Languages (LFMTP'07). Electronic Notes in Computer Science 196 (2008) 137-151
6. Edwin Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005
7. Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In R. Vemuri, editor, Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 203-211, 1991
8. Bruno Barras and Benjamin Werner. Coq in Coq. unpublished
9. Chapman J. Formalisation of Big-Step Normalisation in Agda. Available from (2007). http://www.cs.nott.ac.uk/~jmc/BSN.html
10. 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
11. Anders Danielsson N. A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family. In: Altenkirch T., and McBride C. (Eds). Types for Proofs and Programs. Nottingham, England. LNCS 4502 (April 2006), Springer-Verlag
12. de Bruijn N.G. Lambda Calculus notation with nameless dummies: a tool for automatic formula manipulation. Indagationes Mathematicæ 34 (1972) 381-392
13. Dybjer P., and Setzer A. Indexed induction-recursion. In: Kahle R., Schroeder-Heister P., and Stärk R.F. (Eds). Proof Theory in Computer Science. Lecture Notes in Computer Science volume 2183 (2001), Springer 93-113
14. Dybjer P. Inductive Sets and Families in Martin-Löf's Type Theory. In: Huet G., and Plotkin G. (Eds). Logical Frameworks (1991), CUP
15. Dybjer P. Internal Type Theory. Types for Proofs and Programs, '95. Lecture Notes in Computer Science volume 1158 (1995), Springer-Verlag
16. Healfdene Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1994
17. Hofmann M. Syntax and semantics of dependent types. In: Pitts A.M., and Dybjer P. (Eds). Semantics and Logics of Computation, volume 14 (1997), Cambridge University Press, Cambridge 79-130
18. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1999
19. Martin-Löf P. Intuitionistic Type Theory (1984), BibliopolisṡNapoli
20. Per Martin-Löf. Substitution calculus, 1992. Notes from a lecture given in Göteborg
21. Martin-Löf P. An intuitionistic theory of types. In: Sambin G., and Smith J. (Eds). Twenty-five years of constructive type theory. Oxford Logic Guides volume 36 (1998), Oxford University Press
22. Norell U. Agda 2 (2007). http://www.cs.chalmers.se/~ulfn/
23. Robert Pollack. The Theory of LEGO. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1995
24. Streicher T. Semantics of type theory: correctness, completeness, and independence results (1991), Birkhäuser Boston Inc., Cambridge, MA, USA