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☆49Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated 9 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated last week
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- haha I'm graduating☆14Updated 4 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
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- 🪆 A Staged Type Theory☆35Updated last year
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- ☆36Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆20Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- ☆17Updated 6 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago