lsrcz / grisetteLinks
A monadic library for symbolic evaluation
☆69Updated 3 months ago
Alternatives and similar repositories for grisette
Users that are interested in grisette are comparing it to the libraries listed below
Sorting:
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Lecture notes on realizability☆74Updated 8 months ago
- Convert Haskell source code to Coq source code.☆88Updated 4 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- A tutorial on how Agda infers things☆62Updated 3 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 2 weeks ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆69Updated last year
- Logical Relation for MLTT in Coq☆27Updated this week
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated last week
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆68Updated last year
- Mechanizations of Type Theories☆32Updated 2 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Educational Proof Assistant for Type Theory☆75Updated last year
- Experiments with SAT solvers with proofs in Lean 4☆62Updated last year
- HoTT in Lean 3☆82Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆56Updated 3 months ago
- PL conference deadline countdowns☆63Updated last month
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- A (formalised) general definition of type theories☆57Updated 4 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago