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:
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ModTT in Agda☆11Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- ☆36Updated 3 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated 2 weeks ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago