The original Edinburgh LCF.
☆34Oct 21, 2016Updated 9 years ago
Alternatives and similar repositories for LCF77
Users that are interested in LCF77 are comparing it to the libraries listed below
Sorting:
- ☆12Jan 25, 2022Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 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
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Implementation of Nuprl's type theory in Coq☆46Feb 25, 2026Updated last week
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 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
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆56Jan 22, 2026Updated last month
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years 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
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- (the first half of) an ML compiler☆10Sep 6, 2014Updated 11 years ago