NbE course @ Chalmers
☆28Sep 24, 2024Updated last year
Alternatives and similar repositories for nbe-course
Users that are interested in nbe-course are comparing it to the libraries listed below
Sorting:
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- Coq library for handling names☆19Aug 5, 2022Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆77Jul 30, 2018Updated 7 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated last month
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆102Jun 8, 2022Updated 3 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Formalizing nbe in agda☆32Nov 22, 2012Updated 13 years ago
- ☆26Feb 7, 2017Updated 9 years ago