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 6 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Updated 3 months ago
- haha I'm graduating☆14Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago
- ☆17Updated 7 years ago
- Formalization of type theory☆22Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year