wilbowma / dissertationLinks
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 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆21Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 11 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- being an experiment with potato power☆23Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Type theory in type theory☆16Updated 13 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Denotational semantics based on graph and filter models☆23Updated 5 months ago
- System F in coq.☆19Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated last week
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago