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
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 5 months 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
- Partial Commutative Monoids☆29Updated 3 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Advent of Code 2020 solutions in Lean 4☆26Updated 4 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- An equational theorem prover based on Knuth-Bendix completion☆54Updated 2 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- ☆13Updated last month
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- HoTT in Lean 3☆80Updated 5 years ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Relation algebra library for Coq☆49Updated 5 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month