wenkokke / schmitty
Agda bindings to SMT-LIB2 compatible solvers.
☆95Updated last month
Related projects ⓘ
Alternatives and complementary repositories for schmitty
- A slow-paced introduction to reflection in Agda. ---Tactics!☆95Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- A (formalised) general definition of type theories☆56Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- ☆45Updated 5 years ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Total Parser Combinators in Agda☆123Updated last year
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- HoTT in Lean 3☆75Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- Categorical logic from a categorical point of view☆76Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Programming library for Agda☆121Updated 2 months ago
- Organization and planning for the Initial Types Club☆71Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- being the materials for Summer 2013's course☆110Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 8 months ago
- Agda programming with holes☆26Updated 3 years ago