laelath / well-typed-term-generatorLinks
A OCaml generator for well-typed terms (that use their arguments).
☆10Updated 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☆26Updated 3 weeks ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- A style guide for Coq☆18Updated 3 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated 3 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Lenses in Coq☆17Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Logical Relation for MLTT in Coq☆27Updated last week
- Quasi-quoting library for agda☆18Updated 11 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- Mechanizations of Type Theories☆32Updated this week
- ☆17Updated 4 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- ☆21Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 7 months ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- ☆17Updated 3 years ago
- my phd thesis☆26Updated last year
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months 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
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated last month
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆14Updated last year