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:
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Combinatorial species in HoTT☆12Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- secret project☆17Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Generation of abstract binding trees☆27Updated 10 months ago
- ☆17Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆27Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- ☆18Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- A discouraging story.☆16Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆29Updated 9 years ago
- OCaml backend for Agda☆40Updated 6 years ago