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:
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated this week
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 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
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- ☆11Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago