Monadic presentations of lambda terms using generalized inductive types

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

Volumn 1683, Issue , 1999, Pages 453-468

  Altenkirch, Thorsten ^a   Reus, Bernhard ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

A calculus; Category theory; Inductive types; Type theory

Indexed keywords

CALCULATIONS;

A-CALCULUS; CATEGORY THEORY; DEPENDENT TYPES; INDUCTIVE-TYPE; LAMBDA TERMS; RECURSIONS; STRUCTURAL INDUCTION; TYPE THEORY;

COMPUTER CIRCUITS;

EID: 84956864074     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_32     Document Type: Conference Paper

References (26)

1. T. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, November 1993.
2. T. Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In J.F. Groote M. Bezem, editor, Typed Lambda Calculi and Applications, LNCS 664, pages 13-28, 1993.
3. T. Altenkirch. Logical relations and inductive/coinductive types. Proceedings of CSL 98, LNCS 1584, pages 343-354,1998.
4. T. Altenkirch. Extensional equality in intensional type theory. In Proceedings of LICS 99, pages 412-420, 1999.
5. M. Abadi and G. Plotkin. A logic for parametric polymorphism. In Typed Lambda Calculi and Applications–TLCA’93, pages 361-375, 1993.
6. F. Bellegarde and J. Hook. Substitution: A formal methods case study using monads and transformations. Science of Computer Programming, 23(2-3), 1994.
7. R. Bird and L. Meertens. Nested datatypes. In J. Jeuring, editor, Mathematics of Program Construction, number 1422 in LNCS, pages 52-67. Springer Verlag, 1998. 468 T. Altenkirch and B. Reus
8. R. Bird and R. Paterson. de Bruijn notation as a nested datatype. Journal of Functional Programming, 9:77-91, 1999.
9. P. Dybjer. Inductive families. Formal Aspects of Computing, 6(4):440–465, 1994.
10. M. Emms and H. Leiss. Extending the type checker of Standard ML by polymorphic recursion. TCS, 212(1), 1999.
11. M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proceedings of LICS 99, pages 193–204,1999.
12. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
13. P. Hudak et al. Report on the programming language Haskell: a non-strict, purely functional language (version 1.2). ACM SIGPLAN Notices, 27(5), May 1992.
14. R. Harper, D. MacQueen, and R. Milner. Standard ML. Technical Report ECS-LFCS-86-2, Department of Computer Science, University of Edinburgh, 1986.
15. M. Hofmann. Semantics of Logics of Computation, chapter Syntax and Semantics of Dependent Types. Cambridge University Press, 1997.
16. M. Hofmann. Semantical analysis in higher order abstract syntax. In Proceedings of LICS 99, pages 204-213, 1999.
17. G. Huet. Constructive computation theory PART I. Notes de cours, 1992.
18. Z. Luo and R. Pollack. The LEGO proof development system: A user’s manual. LFCS report ECS-LFCS-92-211, University of Edinburgh, 1992.
19. E. Manes. Algebraic Theories, volume 26 of Graduate Texts in Mathematics. Springer Verlag, 1976.
20. P. Martin-Lof. Intuitionistic Type Theory. Bibliopolis, 1984.
21. S. Mac Lane. Categories for the Working Mathematician. Springer Verlag, 1971.
22. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
23. J. McKinna and R. Pollack. Pure type systems formalized. In Proceedings TLCA’93, LNCS 664, pages 289-305, 1993.
24. B. Reus and T. Altenkirch. The implementation of the λ-monad in LEGO. Available on the WWW at: http://www.informatik.uni-muenchen.de/˜reus/drafts/lambda.html, March 1999.
25. J. Flum and M. Rodriguez-Artalejo (Eds.): CSL'99, LNCS
26. P. Wadler. Theorems for free! In 4’th Symposium on Functional Programming Languages and Computer Architecture, ACM, London, September 1989.