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:
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- 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
- Research material of Erik Palmgren (1963–2019)☆21Updated 5 months ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Advent of Code 2020 solutions in Lean 4☆26Updated 4 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 11 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆54Updated 2 weeks ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Algebraic Combinatorics in Coq☆39Updated last week
- Algebraic proof discovery in Agda☆34Updated 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
- ☆47Updated 2 years ago
- ☆33Updated 3 months ago
- ☆29Updated 3 years ago
- Partial Commutative Monoids☆29Updated 3 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Relation algebra library for Coq☆49Updated 2 weeks ago
- ☆20Updated 5 months ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Ground Zero: Lean 4 HoTT Library☆70Updated last week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month