Comonads By Example Conference talk
☆90Aug 6, 2019Updated 6 years ago
Alternatives and similar repositories for comonads-by-example
Users that are interested in comonads-by-example are comparing it to the libraries listed below
Sorting:
- Some info that supposed to help to understand PureScript from Haskell perspective☆32Aug 22, 2018Updated 7 years ago
- A Pandoc filter that identifies Haskell code in Markdown, executes the code in GHCI and embeds the results in the returned Markdown.☆14Jul 11, 2019Updated 6 years ago
- The Event type, extracted from purescript-behaviors☆22Dec 26, 2020Updated 5 years ago
- tools for writing better type errors☆73Sep 15, 2023Updated 2 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Oct 2, 2022Updated 3 years ago
- A reversible language☆22Sep 25, 2018Updated 7 years ago
- Order theory☆25Sep 7, 2023Updated 2 years ago
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Aug 16, 2020Updated 5 years ago
- type level sets☆67Nov 19, 2019Updated 6 years ago
- Higher-order FRP for PureScript☆13Dec 24, 2022Updated 3 years ago
- A very basic glob library for PureScript.☆11Jan 26, 2025Updated last year
- static analysis of free monads☆24Jul 10, 2018Updated 7 years ago
- Library support for the compiler-builtin Coercible type class.☆20Apr 27, 2022Updated 3 years ago
- A simple combinator library☆30Nov 5, 2018Updated 7 years ago
- Type-level list of kinds for PureScript.☆14Nov 17, 2021Updated 4 years ago
- Argonaut codecs for aeson generic encoding☆12Dec 24, 2022Updated 3 years ago
- A library for building bots compositionally.☆52Mar 10, 2025Updated 11 months ago
- Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically☆211Oct 22, 2025Updated 4 months ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Dec 15, 2025Updated 2 months ago
- A small PureScript only MVC library☆13Jan 6, 2023Updated 3 years ago
- GraphQL Schema generation in Haskell☆17Mar 27, 2020Updated 5 years ago
- QuickCheck powered law tests for PureScript's core typeclasses.☆26Oct 17, 2022Updated 3 years ago
- An implementation of Pie in Haskell☆211Nov 8, 2019Updated 6 years ago
- ☆14Dec 28, 2020Updated 5 years ago
- Optics as an abstract interface☆387Feb 10, 2026Updated 3 weeks ago
- higher-order, no-boilerplate monads☆1,076Mar 15, 2025Updated 11 months ago
- Active streaming declarative programmers. See who's online at the following URL:☆67Jun 29, 2025Updated 8 months ago
- A Purescript data type for untagged unions☆51Dec 10, 2022Updated 3 years ago
- Stack-safe monad transformers implemented using continuation-passing style and uncurried functions.☆23Aug 28, 2022Updated 3 years ago
- Classes for filterable and witherable data structures☆24Apr 27, 2022Updated 3 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- An implementation of algebraic graphs in PureScript☆19Jan 22, 2023Updated 3 years ago
- Type class and functions for working with newtypes☆15Sep 3, 2022Updated 3 years ago
- Higher-kinded data via generics☆170Aug 20, 2024Updated last year
- Fast, hash-based, immutable collections.☆26Mar 8, 2024Updated last year
- Map lazy functional language constructs to LLVM IR☆52Jun 21, 2019Updated 6 years ago
- Experimental, user-contributed effects and interpreters for polysemy☆72Aug 3, 2023Updated 2 years ago
- Purescript refinement types with runtime checking☆25Sep 17, 2022Updated 3 years ago
- A library for parsing Gerbers☆20Jun 20, 2025Updated 8 months ago