oisdk / agda-ring-solverLinks
A fast, easy-to-use ring solver for agda with step-by-step solutions
☆40Updated 3 years ago
Alternatives and similar repositories for agda-ring-solver
Users that are interested in agda-ring-solver are comparing it to the libraries listed below
Sorting:
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- ☆32Updated 7 years ago
- Where my everyday research happens☆55Updated 3 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 11 months ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Paper and talk☆55Updated 2 years ago
- Toy language to show the conversion of embedded higher-order abstract syntax (HOAS)☆21Updated 12 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- ☆29Updated 3 years ago
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆21Updated last year