lsrcz / grisetteLinks
A monadic library for symbolic evaluation
☆68Updated last month
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 11 months ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆64Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Logical Relation for MLTT in Coq☆27Updated last month
- Unification and type inference algorithms☆125Updated 10 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- A tutorial on how Agda infers things☆60Updated last month
- Lecture notes on realizability☆74Updated 6 months ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated last week
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆68Updated last year
- A Seamless, Interactive Tactic Learner and Prover for Coq☆75Updated 3 weeks ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- A style guide for Coq☆18Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆46Updated 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
- Convert Haskell source code to Coq source code.☆86Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆20Updated 3 months ago
- Mechanizations of Type Theories☆31Updated last week
- ☆53Updated this week
- Deadlock freedom by type checking☆20Updated 2 years ago
- ☆21Updated 4 years ago
- ☆15Updated last year
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated 4 months ago
- PL conference deadline countdowns☆61Updated last month