exercism / coq
Exercism exercises in Coq.
☆18Updated 6 months ago
Alternatives and similar repositories for coq:
Users that are interested in coq are comparing it to the libraries listed below
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated 3 weeks ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 5 months ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- TODO☆10Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Agda-style equational reasoning in Haskell☆53Updated last month
- Recursion schemes for Idris☆64Updated 6 years ago
- Dependently-typed finite maps (partial dependent products)☆66Updated 2 months ago
- Effectful bindings for SQLite (forked from IdrisWeb)☆41Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- ☆22Updated 8 years ago
- ☆84Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …☆3Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- ☆30Updated 6 years ago
- Synthetic Differential Geometry in Agda☆12Updated 10 years ago
- Cohesive type theory☆19Updated 3 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- enumerative property-based testing for Haskell☆53Updated 3 months ago
- Invertible parsing for S-expressions☆34Updated last month
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Proof that Haskell can look and act like an imperative language.☆74Updated 12 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A proper network library for Idris, now that I know what I'm doing.☆58Updated 8 years ago