fizruk / lambda-mu-mu-calculusView external linksLinks
Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).
☆20Oct 8, 2020Updated 5 years ago
Alternatives and similar repositories for lambda-mu-mu-calculus
Users that are interested in lambda-mu-mu-calculus are comparing it to the libraries listed below
Sorting:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- a library for experimental linear lambda calculus☆20Mar 18, 2023Updated 2 years ago
- ☆15Oct 31, 2023Updated 2 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 4 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- An approach to higher algebra in type theory☆23May 12, 2020Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 2 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Jan 3, 2025Updated last year
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Session types in Idris2!☆27Dec 14, 2020Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Jan 28, 2026Updated 2 weeks ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 2 years ago
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- high-performance cubical evaluation☆79Apr 27, 2025Updated 9 months ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- A http client for Idris based on libcurl☆10Mar 18, 2016Updated 9 years ago
- A Coq development of the theory of Indexed W types with function extensionality.☆11Sep 13, 2017Updated 8 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 4 months ago
- ☆11Jul 2, 2024Updated last year
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆12Dec 2, 2025Updated 2 months ago
- Coq Lecture Notes (WIP)☆56Oct 17, 2020Updated 5 years ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆124Jan 24, 2026Updated 2 weeks ago
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆18Oct 14, 2025Updated 3 months ago
- Effectful Streaming for Idris☆15Dec 13, 2020Updated 5 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- A path to Recursion Schemes☆10Apr 20, 2020Updated 5 years ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set☆14Nov 14, 2025Updated 2 months ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15May 22, 2024Updated last year
- translations of a lambda abstraction to combinations of operators☆18Sep 6, 2019Updated 6 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago