tuura / selective-theory-coqLinks
Selective applicative functors laws and theorems
☆14Updated 5 years ago
Alternatives and similar repositories for selective-theory-coq
Users that are interested in selective-theory-coq are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- ☆18Updated 3 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Combinatorial species in HoTT☆12Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- ☆17Updated 7 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 6 months ago
- MetaML and MetaOCaml bibliography☆94Updated 10 months ago
- secret project☆17Updated 7 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆21Updated 7 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- being an experiment with potato power☆23Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆27Updated 2 years ago