llee454 / functional-algebra
This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the package span monoids, groups, rings, and fields and provides both axiom definitions for these structures and proofs of foundational results. The current package contains over 800 definitions and proofs.
☆28Updated 6 years ago
Alternatives and similar repositories for functional-algebra:
Users that are interested in functional-algebra are comparing it to the libraries listed below
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆29Updated 2 years ago
- ☆17Updated 6 years ago
- Formalization of type theory☆22Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆19Updated 3 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- Mtac in Agda☆28Updated 4 years ago
- 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
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆29Updated 2 years ago
- ☆18Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago