laelath / well-typed-term-generatorLinks
A OCaml generator for well-typed terms (that use their arguments).
☆11Updated 11 months ago
Alternatives and similar repositories for well-typed-term-generator
Users that are interested in well-typed-term-generator are comparing it to the libraries listed below
Sorting:
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 2 weeks ago
- A style guide for Coq☆18Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 9 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated 2 months ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Relation algebra library for Coq☆50Updated this week
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆40Updated last month
- ☆14Updated 8 months ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆36Updated 2 months ago
- Congruence Closure Procedure in Cubical Agda☆19Updated 5 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆12Updated last month
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- Lenses in Coq☆17Updated 3 years ago
- Logical Relation for MLTT in Coq☆28Updated 2 weeks ago
- Tiny verified SAT-solver☆30Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆71Updated 2 months ago
- Finite sets and maps for Coq with extensional equality☆30Updated 2 weeks ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- ☆26Updated 3 weeks ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago