The source for "Compiling with Dependent Types" (my dissertation)
☆30May 10, 2022Updated 3 years ago
Alternatives and similar repositories for dissertation
Users that are interested in dissertation are comparing it to the libraries listed below
Sorting:
- ☆17Oct 16, 2018Updated 7 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Feb 21, 2020Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Jun 8, 2022Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- A TACtic library for Agda☆51Sep 14, 2024Updated last year
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- An experimental Haskell library for programming with effectful runners.☆30Dec 6, 2019Updated 6 years ago
- A LaTeX package for formatting meta-theory.☆46Nov 19, 2020Updated 5 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- Expands type synonyms in Template Haskell ASTs☆11Jan 10, 2026Updated last month
- ☆11Jul 20, 2016Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago