avigad / arwmLinks
Automated Reasoning for the Working Mathematician
☆11Updated 6 years ago
Alternatives and similar repositories for arwm
Users that are interested in arwm are comparing it to the libraries listed below
Sorting:
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 6 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆56Updated 2 weeks ago
- A type theory with native support for Polynomial Functors.☆39Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Advent of Code 2020 solutions in Lean 4☆26Updated 4 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- ☆45Updated 6 months ago
- ☆47Updated 2 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Lean4 port of Arduino balance car controller☆47Updated 4 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- ☆36Updated 4 years ago