Bidirectional programming in Haskell with monadic profunctors
☆49May 17, 2022Updated 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- An attoparsec roundtrip☆19Apr 23, 2020Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Dynamically-typed Haskell expressions involving applications and variables.☆22Jan 30, 2025Updated last year
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Mar 21, 2021Updated 5 years ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Aug 16, 2020Updated 5 years ago
- ☆12May 22, 2016Updated 9 years ago
- Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).☆12Nov 28, 2023Updated 2 years ago
- Talk on generic parallel scan☆14May 12, 2017Updated 8 years ago
- Total Parser Combinators in Agda☆134Aug 5, 2025Updated 7 months ago
- Observational Type Theory as an Agda library☆59May 27, 2017Updated 8 years ago
- Invertible parsing for S-expressions☆34Feb 4, 2026Updated last month
- Source Layouting Engine☆11Mar 7, 2021Updated 5 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- My attempt to better understand both Coq and Category Theory by formalizing the latter in the former.☆14Aug 3, 2019Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- 🍰🍴Template project based on the cake-slayer architecture library☆19Jan 11, 2023Updated 3 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Alternative Core language for GHC plugins☆39Feb 15, 2016Updated 10 years ago
- A framework for implementing and certifying impure computations in Coq☆53Jan 16, 2024Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A Haskell implementation of the Formality language☆18Mar 9, 2020Updated 6 years ago
- Work in progress☆40Jun 7, 2025Updated 9 months ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- TParsec - Total Parser Combinators in Idris☆99Aug 7, 2023Updated 2 years ago
- A simple library I wrote to allow me to quickly and easily construct command line interfaces.☆28Feb 25, 2026Updated last month
- probabilistic programming in Haskell☆17Aug 26, 2016Updated 9 years ago
- A GHC type checker plugin for row types☆39Oct 7, 2017Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago