Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.
☆18Oct 12, 2018Updated 7 years ago
Alternatives and similar repositories for Manifold
Users that are interested in Manifold are comparing it to the libraries listed below
Sorting:
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- being a thing I build on a Saturday☆28Mar 5, 2018Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- ☆10May 3, 2017Updated 8 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- An implementation of generic authenticated data structures in OCaml☆16Sep 24, 2019Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Dec 29, 2023Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- topos programming☆31Sep 20, 2018Updated 7 years ago
- Haskell implementation of interaction net-based lambda evaluation☆21Jun 24, 2016Updated 9 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 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
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Coherence typechecker for infinity categories☆20Dec 29, 2025Updated last month
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Feb 22, 2020Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- Implementing grep in Agda☆33Jan 11, 2021Updated 5 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago