lsrcz / grisetteLinks
A monadic library for symbolic evaluation
☆73Updated 6 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]☆69Updated last year
- Lecture notes on realizability☆75Updated 11 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆58Updated 7 months ago
- Educational Proof Assistant for Type Theory☆80Updated 3 weeks ago
- Convert Haskell source code to Coq source code.☆93Updated 7 months ago
- Logical Relation for MLTT in Coq☆29Updated 3 weeks ago
- Experiments with SAT solvers with proofs in Lean 4☆63Updated last year
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆70Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- A Seamless, Interactive Tactic Learner and Prover for Coq☆82Updated last week
- A tutorial on how Agda infers things☆64Updated 7 months ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆48Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 5 months ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆104Updated 6 months ago
- antifunext☆38Updated last year
- Datatypes as quotients of polynomial functors☆41Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 2 weeks ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Updated 9 months ago