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
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 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
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆17Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- IO using sized types and copatterns☆36Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- haha I'm graduating☆14Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- 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
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Quasi-quoting library for agda☆18Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalization of type theory☆22Updated 4 years ago
- ☆17Updated last year
- Constructive Galois connections☆35Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago