langston-barrett / coq-big-oLinks
A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
☆35Updated 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 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- 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 showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Constructive Galois connections☆34Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 3 weeks ago
- Formalizing nbe in agda☆31Updated 12 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Work in progress☆37Updated 2 months ago
- ☆26Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Category theory and algebra☆28Updated 9 years ago