Minimalistic dependent type theory with syntactic metaprogramming
☆60Jun 18, 2024Updated last year
Alternatives and similar repositories for meta-cedille
Users that are interested in meta-cedille are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Agda to C compiler☆10Sep 23, 2025Updated 6 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Observational Type Theory as an Agda library☆59May 27, 2017Updated 8 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 4 months ago
- 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
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- ☆23Jul 1, 2024Updated last year
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- ☆18May 10, 2022Updated 3 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Dec 13, 2018Updated 7 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 4 months ago
- Experiments in implementing functional data structures in Idris☆15Jul 25, 2019Updated 6 years ago
- Verified NbE via gluing in Agda☆11May 19, 2024Updated last year
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- ☆16Dec 28, 2021Updated 4 years ago
- A collection of mechanised proofs☆19Feb 4, 2020Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A tutorial on how Agda infers things☆64Jul 10, 2025Updated 8 months ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago