rodrigogribeiro / idrisregexp
Regular expression matching in Idris
☆11Updated 8 years ago
Alternatives and similar repositories for idrisregexp:
Users that are interested in idrisregexp are comparing it to the libraries listed below
- Some benchmarks for Idris☆12Updated 7 years ago
- A http client for Idris based on libcurl☆10Updated 8 years ago
- ☆23Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Typed DSLs for sorting☆19Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- Curses bindings package for Idris☆13Updated 6 years ago
- Parsers for various configuration files written in Idris.☆19Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆15Updated 5 years ago
- A simple XML module for Idris.☆13Updated 4 years ago
- ☆22Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- A small bifunctor library for idris☆21Updated 4 years ago
- Effectful bindings for SQLite (forked from IdrisWeb)☆41Updated 6 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 9 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆13Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- ☆17Updated 2 years ago
- A semantic highlighter for Idris code☆14Updated 7 years ago
- A small library for tracking mutable state in Idris programs☆12Updated 7 years ago
- A recursion scheme library for Idris.☆24Updated 3 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- OCaml back end for Idris☆22Updated 7 years ago
- ☆21Updated 7 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 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
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 9 months ago