andrejbauer / miniLCFLinks
A bare-bones LCF-style proof assistant
☆24Updated 6 years ago
Alternatives and similar repositories for miniLCF
Users that are interested in miniLCF are comparing it to the libraries listed below
Sorting:
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- 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
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- ☆15Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- 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 dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- ☆11Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago