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:
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 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
- ☆17Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months 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
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Graded Dependent Type systems☆25Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- ☆38Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- haha I'm graduating☆14Updated 4 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago