wilbowma / dissertation
The source for "Compiling with Dependent Types" (my dissertation)
☆30Updated 2 years ago
Alternatives and similar repositories for dissertation:
Users that are interested in dissertation are comparing it to the libraries listed below
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆18Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 7 months ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆17Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆20Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A discouraging story.☆15Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Constructive Galois connections☆32Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated last month
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago