Monadic Presentations of Lambda Terms Using Generalized Inductive Types
- 1 January 1999
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 453-468
- https://doi.org/10.1007/3-540-48168-0_32
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A logic for parametric polymorphismPublished by Springer Science and Business Media LLC ,2006
- A formalization of the strong normalization proof for System F in LEGOPublished by Springer Science and Business Media LLC ,2006
- Pure type systems formalizedPublished by Springer Science and Business Media LLC ,2005
- Extending the type checker of Standard ML by polymorphic recursionTheoretical Computer Science, 1999
- de Bruijn notation as a nested datatypeJournal of Functional Programming, 1999
- Nested datatypesLecture Notes in Computer Science, 1998
- Syntax and Semantics of Dependent TypesPublished by Cambridge University Press (CUP) ,1997
- Substitution: A formal methods case study using monads and transformationsScience of Computer Programming, 1994
- Inductive familiesFormal Aspects of Computing, 1994
- Report on the programming language HaskellACM SIGPLAN Notices, 1992