The Evolution of a Typechecker
☆54Jan 20, 2019Updated 7 years ago
Alternatives and similar repositories for typechecker-evolution
Users that are interested in typechecker-evolution are comparing it to the libraries listed below
Sorting:
- MPRI-2.4 Dependently-typed Functional Programming☆32Dec 10, 2020Updated 5 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- ☆10May 3, 2017Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆56Jan 22, 2026Updated last month
- Syntaxes with Binding, Their Programs, and Proofs☆23Oct 26, 2023Updated 2 years ago
- Proof automation – for Agda, in Agda.☆45Sep 7, 2020Updated 5 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- ☆26Feb 7, 2017Updated 9 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Where my everyday research happens☆56Feb 17, 2026Updated last week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Language mixing functional programming and Ambient Calculus☆12Dec 10, 2024Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- An Agda formalisation of the theory of directed containers☆12Apr 25, 2025Updated 10 months ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- A simple test framework for Ligo Lang☆13Mar 29, 2024Updated last year
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- A toolkit to manipulate Scribble-style multiparty protocols, based on classical multiparty session type theory.☆29Oct 20, 2025Updated 4 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago