tuura / selective-theory-coq
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
- A repository of MetaOCaml packages☆12Updated last year
- ☆18Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- A discouraging story.☆15Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- secret project☆17Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆17Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A minimalist implementation of type theory, suitable for experimentation☆15Updated 5 months ago
- ☆21Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- ☆29Updated 9 years ago