lsrcz / grisetteLinks
A monadic library for symbolic evaluation
☆71Updated 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]☆67Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last month
- A tutorial on how Agda infers things☆63Updated 4 months ago
- Convert Haskell source code to Coq source code.☆90Updated 4 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Lecture notes on realizability☆74Updated 8 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆69Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated last week
- Mechanizations of Type Theories☆32Updated this week
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Updated 6 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- Experiments with SAT solvers with proofs in Lean 4☆62Updated last year
- Formalizations of Gradually Typed Languages in Agda☆58Updated this week
- PL conference deadline countdowns☆63Updated 2 months ago
- Logical Relation for MLTT in Coq☆27Updated last week
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- A Coq library for parametric coinduction☆50Updated 9 months ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆67Updated this week
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆37Updated last month
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month