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:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- haha I'm graduating☆14Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 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
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆34Updated 3 weeks ago
- ☆17Updated 7 years ago
- ☆18Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 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☆35Updated 7 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A type theory with native support for Polynomial Functors.☆39Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago