Epigram: Practical Programming with Dependent Types
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 130-170
- https://doi.org/10.1007/11546382_3
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The view from the leftJournal of Functional Programming, 2004
- First-order unification by structural recursionJournal of Functional Programming, 2003
- Scrap your boilerplateACM SIGPLAN Notices, 2003
- Faking it Simulating dependent types in HaskellJournal of Functional Programming, 2002
- Do we need dependent types?Journal of Functional Programming, 2000
- de Bruijn notation as a nested datatypeJournal of Functional Programming, 1999
- Substitution: A formal methods case study using monads and transformationsScience of Computer Programming, 1994
- Inductive sets and families in Martin-Löf's type theory and their set-theoretic semanticsPublished by Cambridge University Press (CUP) ,1991
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965