reynir / Verified
A collection of proofs for some idris class instances - NOT MAINTAINED
☆18Updated 9 years ago
Alternatives and similar repositories for Verified:
Users that are interested in Verified are comparing it to the libraries listed below
- Typed DSLs for sorting☆19Updated 7 years ago
- A simple XML module for Idris.☆13Updated 4 years ago
- ☆22Updated 8 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Abstactions and concrete implementations of mutable containers☆14Updated 8 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 8 years ago
- ☆23Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- simple interface to ghc's simd vector support☆23Updated 9 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- A small bifunctor library for idris☆21Updated 4 years ago
- OCaml back end for Idris☆22Updated 7 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆13Updated 7 years ago
- Succinct vectors☆20Updated 6 years ago
- Effectful bindings for SQLite (forked from IdrisWeb)☆41Updated 6 years ago
- Some benchmarks for Idris☆12Updated 7 years ago
- Try Idris☆35Updated 9 years ago
- ☆17Updated 2 years ago
- Haskell routes using dependent types☆10Updated 8 years ago
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- [Talk] Framing the Discussion with EDSLs☆9Updated 9 years ago
- The Wadler/Leijen Pretty Printer for colored ANSI terminal output☆30Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Haskell: Efficiently build a bytestring from smaller chunks☆24Updated 2 years ago
- ☆23Updated 7 years ago
- 🌋 Idris implementation of patricia tree☆22Updated 4 years ago
- Automatically make lenses from data structures implementing Generic☆26Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 6 years ago