LiamGoodacre / purescript-type-map
A Map data structure at the type level.
☆8Updated 7 years ago
Alternatives and similar repositories for purescript-type-map:
Users that are interested in purescript-type-map are comparing it to the libraries listed below
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Updated 4 years ago
- Leibniz Equality☆18Updated 6 years ago
- Working through Okasaki's "Functional Datastructures" in PureScript☆14Updated 8 years ago
- ☆21Updated 2 years ago
- Applicative Folds, in the style of Gabriel Gonzalez' foldl library☆14Updated 5 years ago
- Experimental polykinds implementation☆13Updated 5 years ago
- Purescript port of Pipes - http://hackage.haskell.org/package/pipes-4.1.9☆32Updated 2 years ago
- Dhall, formalised in Agda☆10Updated 5 years ago
- Types for the least and greatest fixed points of functors.☆15Updated 2 years ago
- DotLang datatypes for purescript☆12Updated 2 years ago
- Lambda calculus at the type level.☆20Updated 7 years ago
- Free applicative functors for PureScript☆27Updated 2 years ago
- Simple two-dimensional matrices backed by a flat array☆18Updated 5 years ago
- Selective applicative functors☆15Updated 6 years ago
- Basic examples and functions for generics-sop☆20Updated last year
- Transformerless monads for Puresript☆22Updated 6 years ago
- A collection of ready-to-use Prometheus Metrics to monitor your Haskell application☆13Updated 6 months ago
- A combinator for making any monadic control operator stack-safe☆26Updated 5 years ago
- ☆12Updated 4 years ago
- The Event type, extracted from purescript-behaviors☆23Updated 4 years ago
- Structured logging solution.☆35Updated 2 years ago
- Exhaustive pattern matching using lenses, traversals, and prisms☆32Updated 2 years ago
- ☆26Updated 2 years ago
- Purescript bindings for the Ace editor☆19Updated 2 years ago
- Reasonable Haskell default import☆27Updated 2 years ago
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆17Updated last month
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated 6 months ago
- deprecated in favor of -XQualifiedDo☆41Updated 3 years ago
- Computations which can suspend their execution and return control to their invoker☆37Updated 2 years ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 7 years ago