Proofs in Coq for the book Reflective Programs in Tree Calculus
☆179Jun 12, 2021Updated 4 years ago
Alternatives and similar repositories for tree-calculus
Users that are interested in tree-calculus are comparing it to the libraries listed below
Sorting:
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- HoTT Book formalisations in Rzk.☆20Dec 15, 2023Updated 2 years ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago
- translations of a lambda abstraction to combinations of operators☆18Sep 6, 2019Updated 6 years ago
- A work-in-progress core language for Agda, in Agda☆65Updated this week
- source code for the bondi programming language☆45Feb 17, 2019Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- Formalization of 2LTT in Agda☆17Aug 6, 2025Updated 7 months ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- ☆14Jun 7, 2024Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- being a particular fragment of Haskell, extended to a proof system☆44Updated this week
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- Logical manifestations of topological concepts, and other things, via the univalent point of view.☆269Feb 27, 2026Updated last week
- ☆21Jan 24, 2022Updated 4 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 5 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Scope Graph Implementation in Rust☆29Nov 22, 2024Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆33Mar 16, 2021Updated 4 years ago
- An Agda library for programming with ternary relations☆18Apr 9, 2025Updated 10 months ago
- An enhanced unification algorithm for Coq☆59Jan 30, 2026Updated last month
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated this week
- A cost-aware logical framework, embedded in Agda.☆77Feb 23, 2026Updated last week
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- Real number computation software☆129Aug 16, 2022Updated 3 years ago