laelath / well-typed-term-generatorLinks
A OCaml generator for well-typed terms (that use their arguments).
☆11Updated 8 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 this week
- A style guide for Coq☆18Updated 3 years ago
- Lenses in Coq☆17Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 3 months ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Intrinsic Verification of Formal Grammar Theory☆27Updated last week
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- Experimental type-checker for internally parametric type theory☆32Updated 7 months ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Relation algebra library for Coq☆48Updated 2 months ago
- A type theory with native support for Polynomial Functors.☆40Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Coq library on rewriting theory and termination☆37Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- A Coq library for abstract syntactical reasoning☆24Updated 6 months ago
- Logical Relation for MLTT in Coq☆27Updated 2 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- a version of the 2048 game for Coq☆22Updated 2 years ago
- An itree-like data-structure to additionally support internal non-determinism☆20Updated this week
- ☆37Updated 7 months ago