llee454 / functional-algebraLinks
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
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- ☆17Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Revised Omega-categorical Typechecker☆26Updated 6 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ☆18Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 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
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 weeks ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- A repository of MetaOCaml packages☆12Updated 2 weeks ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago