A bare-bones LCF-style proof assistant
☆25Aug 13, 2019Updated 6 years ago
Alternatives and similar repositories for miniLCF
Users that are interested in miniLCF are comparing it to the libraries listed below
Sorting:
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- ☆11Jul 20, 2016Updated 9 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
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- Examples from the class CMSC 330 during Summer 2015☆49Jul 23, 2015Updated 10 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years 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☆57May 27, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- PL syntax macros.☆21Nov 30, 2025Updated 2 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Dec 22, 2025Updated 2 months ago
- Work in progress☆40Jun 7, 2025Updated 8 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago