lsrcz / grisetteLinks
A monadic library for symbolic evaluation
☆67Updated 2 weeks 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]☆59Updated 10 months ago
- Convert Haskell source code to Coq source code.☆86Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆64Updated this week
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- PL conference deadline countdowns☆61Updated 2 weeks ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆67Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- Lecture notes on realizability☆74Updated 5 months ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A tutorial on how Agda infers things☆59Updated 3 weeks ago
- Paper and talk☆54Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated last week
- Logical Relation for MLTT in Coq☆27Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 7 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 9 months ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- Educational Proof Assistant for Type Theory☆74Updated 11 months ago