lsrcz / grisetteLinks
A monadic library for symbolic evaluation
☆69Updated 2 months ago
Alternatives and similar repositories for grisette
Users that are interested in grisette are comparing it to the libraries listed below
Sorting:
- Convert Haskell source code to Coq source code.☆88Updated 3 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated last week
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Paper and talk☆55Updated 2 years ago
- Lecture notes on realizability☆74Updated 7 months ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated last week
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Logical Relation for MLTT in Coq☆27Updated 3 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- PL conference deadline countdowns☆62Updated last month
- high-performance cubical evaluation☆75Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 4 months ago
- Mechanizations of Type Theories☆32Updated last month
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- CS410 "Advanced Functional Programming"☆27Updated 4 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- Eventually a practical 2-level TT-based compiler☆27Updated last week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 2 months ago
- Fast equality saturation in Haskell☆88Updated 2 months ago