A formalisation of a dependently typed language as an inductive-recursive family

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

Volumn 4502 LNCS, Issue , 2007, Pages 93-109

  Danielsson, Nils Anders ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

INDUCTIVE RECURSIVE FAMILY; LAMBDA CALCULUS; NORMALIZATION;

FORMAL LANGUAGES;

EID: 38049136978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74464-1_7     Document Type: Conference Paper

References (24)

1. Abel, A., Altenkirch, T.: A predicative analysis of structural recursion. Journal of Functional Programming 12(1), 1-41 (2002)
2. Abel, A., Aehlig, K., Dybjer, P.: Normalization by evaluation for Martin-Löf type theory with one universe. Submitted for publication (2007)
3. Altenkirch, T., Chapman, J.: Tait in one big step. In: MSFP 2006 (2006)
4. Adams, R.: Formalized metatheory with terms represented by an indexed family of types. In: TYPES 2004. LNCS, vol. 3839, pp. 1-16. Springer, Heidelberg (2004)
5. Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 453-468. Springer, Heidelberg (1999)
6. Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed λ-calculus. In: LICS '91, pp. 203-211 (1991)
7. Barras, B., Werner, B.: Coq in Coq. Unpublished (1997)
8. Coquand, T., Dybjer, P.: Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science 7(1), 75-94 (1997)
9. Coquand, C.: A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions. Higher-Order and Symbolic Computation 15, 57-90 (2002)
10. Danielsson, N.A.: Personal web page. Available (2007) at http://www.cs.chalmers.se/~nad/
11. Dybjer, P., Setzer, A.: Indexed induction-recursion. Journal of Logic and Algebraic Programming 66(1), 1-49 (2006)
12. Dybjer, P.: Internal type theory. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 120-134. Springer, Heidelberg (1996)
13. McBride, C.: Beta-normalization for untyped lambda-calculus (unpublished program)
14. McBride, C.: Type-preserving renaming and substitution (unpublished)
15. Martin-Löf, P.: An intuitionistic theory of types: Predicative part. In: Logic Colloquium '73, pp. 73-118. North-Holland, Amsterdam (1975)
16. Martin-Löf, P.: Normalization by evaluation and by the method of computability. Lecture series given at Logikseminariet Stockholm-Uppsala (2004)
17. Mitchell, J.C., Moggi, E.: Kripke-style models for typed lambda calculus. Annals of Pure and Applied Logic 51, 99-124 (1991)
18. McBride, C., McKinna, J.: The view from the left. Journal of Functional Programming 14(1), 69-111 (2004)
19. McKinna, J., Pollack, R.: Some lambda calculus and type theory formalized. Journal of Automated Reasoning 23(3), 373-409 (1999)
20. McKinna, J., Wright, J.: A type-correct, stack-safe, provably correct expression compiler in Epigram. Accepted for publication in the Journal of Functional Programming (2006)
21. Norell, U.: AgdaLight home page. Available (2007) at http://www.cs. chalmers.se/~ulfn/agdaLight/
22. Nordström, B., Petersson, K., Smith, J.M.: Programming in Martin-Löf's Type Theory, An Introduction. Oxford University Press, Oxford (1990)
23. Pašalić, E., Linger, N.: Meta-programming with typed object-language representations. In: Karsai, G., Visser, E. (eds.) GPCE 2004. LNCS, vol. 3286, pp. 136-167. Springer, Heidelberg (2004)
24. Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: POPL '03, pp. 224-235 (2003)