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 Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 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
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ☆18Updated 3 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ☆36Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- ☆17Updated 6 years ago
- ☆13Updated last month