langston-barrett / coq-big-oLinks
A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
☆36Updated 8 years ago
Alternatives and similar repositories for coq-big-o
Users that are interested in coq-big-o are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- Mtac in Agda☆29Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- ☆17Updated 7 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
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago