Hoogle Search
Within LTS Haskell 24.48 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Set- and Map-like types that remember the order elements were inserted Set- and Map-like types that remember the order elements were inserted
-
Portable regex library for Perl 5 compatible regular expressions A small, efficient and portable regex library for Perl 5 compatible regular expressions. The PCRE library is a set of functions that implement regular expression pattern matching using the same syntax and semantics as Perl 5. If installation fails with missing pcre/pkg-config, try installing the libpcre3-dev package (linux) or running brew install pcre pkg-config (macOS).
-
Privacy Enhanced Mail (PEM) format reader and writer. Privacy Enhanced Mail (PEM) format reader and writer. long description
-
ByteString support for pipes This library provides pipes utilities for ByteStrings
-
Primitive GHC types with unlifted types inside Primitive GHC types with unlifted types inside. There used to be a module named Data.Primitive.UnliftedArray in the primitive library. However, it turns out that it is impossible to write such an API safely in versions of GHC before 8.10.1, thanks to some nasty interactions between unsafe coercions and the foreign function interface. This package also uses a somewhat different, and more flexible, approach than that module did.
-
A lens-based implementation of protocol buffers in Haskell. The proto-lens library provides an API for protocol buffers using modern Haskell language and library patterns. Specifically, it provides:
- Composable field accessors via lenses
- Simple field name resolution/overloading via type-level literals
- Type-safe reflection and encoding/decoding of messages via GADTs
-
A small prelude. A sensible set of defaults for writing custom Preludes.
-
Test properties and default-mains for QuickCheck This package contains definitions of test properties and default-mains using QuickCheck library.
-
Representing common recursion patterns as higher-order functions Many recursive functions share the same structure, e.g. pattern-match on the input and, depending on the data constructor, either recur on a smaller input or terminate the recursion with the base case. Another one: start with a seed value, use it to produce the first element of an infinite list, and recur on a modified seed in order to produce the rest of the list. Such a structure is called a recursion scheme. Using higher-order functions to implement those recursion schemes makes your code clearer, faster, and safer. See README for details.
-
Higher-order Functional Reactive Programming Interactive programs without callbacks or side-effects. Functional Reactive Programming (FRP) uses composable events and time-varying values to describe interactive systems as pure functions. Just like other pure functional code, functional reactive code is easier to get right on the first try, maintain, and reuse. Reflex is a fully-deterministic, higher-order Functional Reactive Programming interface and an engine that efficiently implements that interface. https://reflex-frp.org