Lysxia / profunctor-monadLinks
Bidirectional programming in Haskell with monadic profunctors
☆46Updated 3 years ago
Alternatives and similar repositories for profunctor-monad
Users that are interested in profunctor-monad are comparing it to the libraries listed below
Sorting:
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last week
- ☆30Updated 7 years ago
- A monadic (and pretty) pretty printer for Haskell☆38Updated 2 years ago
- Where my everyday research happens☆53Updated last month
- Agda-style equational reasoning in Haskell☆53Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated 3 weeks ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Implementing grep in Agda☆33Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Compiler backend for generating Scheme code☆26Updated last year