wilbowma / dissertation
The source for "Compiling with Dependent Types" (my dissertation)
☆30Updated 3 years ago
Alternatives and similar repositories for dissertation
Users that are interested in dissertation are comparing it to the libraries listed below
Sorting:
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- A bare-bones LCF-style proof assistant☆23Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- ☆21Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 11 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- ☆18Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- Type theory in type theory☆16Updated 13 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆17Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 3 months ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago