laelath / well-typed-term-generatorLinks
A OCaml generator for well-typed terms (that use their arguments).
☆10Updated 7 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:
- A style guide for Coq☆18Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated last week
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- ☆37Updated 6 months ago
- Lenses in Coq☆17Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated 2 months ago
- a version of the 2048 game for Coq☆22Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated 3 weeks ago
- A Coq library for abstract syntactical reasoning☆24Updated 5 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- Coq library on rewriting theory and termination☆37Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Tiny verified SAT-solver☆30Updated 3 years ago
- A Coq library providing tactics to deal with hypothesis☆21Updated this week
- Logical Relation for MLTT in Coq☆27Updated last month
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 4 months ago
- proof script associated to tutorial material☆17Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆21Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- ☆12Updated 4 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ♾️ A library for universe levels and universe polymorphism☆35Updated last month
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago