andrejbauer / miniLCFLinks
A bare-bones LCF-style proof assistant
☆24Updated 5 years ago
Alternatives and similar repositories for miniLCF
Users that are interested in miniLCF are comparing it to the libraries listed below
Sorting:
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆11Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- my phd thesis☆26Updated 10 months ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 8 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆26Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago