andrejbauer / algLinks
Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.
☆84Updated 4 years ago
Alternatives and similar repositories for alg
Users that are interested in alg are comparing it to the libraries listed below
Sorting:
- A (formalised) general definition of type theories☆58Updated 4 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Real number computation software☆128Updated 3 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆48Updated 2 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- ☆56Updated 6 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 2 months ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- Lecture notes on realizability☆74Updated 8 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- Effective Algebraic Topology in Haskell☆90Updated last year
- Schemes in Lean (v2)☆44Updated 5 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆41Updated last week
- ☆36Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A work-in-progress core language for Agda, in Agda☆59Updated last week
- Hoare Type Theory☆83Updated 5 months ago
- An enhanced unification algorithm for Coq☆58Updated 7 months ago
- A formalization of M-types in Agda☆36Updated 5 years ago