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.
☆29Feb 28, 2019Updated 7 years ago
Alternatives and similar repositories for functional-algebra
Users that are interested in functional-algebra are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆14Nov 23, 2016Updated 9 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 3 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37May 18, 2026Updated 6 months ago
- Sokoban implementation in lean for proving solvability / unsolvability☆14Apr 21, 2021Updated 5 years ago
- Coq formalizations of functional languages.☆146Jul 2, 2020Updated 6 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- ☆12Dec 4, 2021Updated 4 years ago
- Prototype code for some Julia-OCaml bindings☆16Jan 3, 2021Updated 5 years ago
- ☆58Nov 9, 2026Updated last week
- A library of mechanised undecidability proofs in the Coq proof assistant.☆145Jun 24, 2026Updated 4 months ago
- Composable intrincially-typed definitional interpreters☆17Nov 13, 2022Updated 4 years ago
- ☆14Aug 5, 2026Updated 3 months ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆32Sep 21, 2022Updated 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…☆20Dec 8, 2021Updated 4 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Automated Reasoning for the Working Mathematician☆11Aug 30, 2019Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 4 years ago
- Fast Setup for Proof by Reflection, in Two Lines of Ltac.☆14Jan 12, 2021Updated 5 years ago
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- A small NuPRL style proof assistant☆32Jan 31, 2019Updated 7 years ago
- Formalization of some elementary mathematical theories in Coq☆16Mar 29, 2020Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 7 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 6 years ago
- Communication between Coq and SAT/SMT solvers☆170Oct 29, 2026Updated 3 weeks ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Gallina to Bedrock2 compilation toolkit☆72Updated this week
- The Coq formalization of the paper Reasoning about the garden of forking paths.☆26Feb 7, 2025Updated last year
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆33May 13, 2019Updated 7 years ago
- Category theory and algebra☆27Aug 4, 2016Updated 10 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆19Jul 9, 2018Updated 8 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Sep 13, 2026Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆40Jun 19, 2026Updated 5 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Finite sets, finite maps, multisets and generic sets☆51Nov 9, 2026Updated last week
- A function definition package for Rocq☆239Updated this week
- (now moved to Codeberg) An equational theorem prover based on Knuth-Bendix completion☆61Jul 14, 2026Updated 4 months ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- OCaml library to transform an Llvm control flow graph in an SMT formula.☆13Apr 20, 2018Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 7 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆27Nov 14, 2026Updated last week
Are these results useful?