wenkokke / schmittyLinks
Agda bindings to SMT-LIB2 compatible solvers.
☆102Updated last month
Alternatives and similar repositories for schmitty
Users that are interested in schmitty are comparing it to the libraries listed below
Sorting:
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Programming library for Agda☆130Updated last year
- Total Parser Combinators in Agda☆132Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- Categorical logic from a categorical point of view☆80Updated last year
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- Agda programming with holes☆27Updated 4 years ago
- Lecture notes on realizability