wenkokke / schmitty
Agda bindings to SMT-LIB2 compatible solvers.
☆96Updated 5 months ago
Alternatives and similar repositories for schmitty:
Users that are interested in schmitty are comparing it to the libraries listed below
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆99Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Total Parser Combinators in Agda☆126Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆55Updated 5 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Programming library for Agda☆126Updated 6 months ago
- An experimental type checker for a modal dependent type theory.☆109Updated 4 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- Benchmarks for capture-avoiding substitution☆113Updated 3 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- ☆84Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- A TACtic library for Agda☆48Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- being an operating system for typechecking processes☆124Updated last year
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- Categorical logic from a categorical point of view☆77Updated last year