laelath / well-typed-term-generatorLinks
A OCaml generator for well-typed terms (that use their arguments).
☆11Updated 10 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 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 2 weeks ago
- Congruence Closure Procedure in Cubical Agda☆18Updated 5 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last month
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- A Coq library for abstract syntactical reasoning☆24Updated 8 months ago
- Relation algebra library for Coq☆49Updated last month
- ♾️ A library for universe levels and universe polymorphism☆36Updated last month
- Lenses in Coq☆17Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 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
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆11Updated last month
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Logical Relation for MLTT in Coq☆28Updated last month
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆18Updated last month
- Quasi-quoting library for agda☆18Updated last year
- 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
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 7 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago