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:
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- IO using sized types and copatterns☆36Updated 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 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 weeks ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- haha I'm graduating☆14Updated 4 years ago
- ☆36Updated 4 years ago
- ☆17Updated 7 years ago
- ☆17Updated last year
- ☆18Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago