Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Alternative faster String representations for Double and Float, String representations for more general numeric types. The String representations provided by this package are generally longer than show's output, which constructs the shortest string that is parsed as the original number by read. This requires some time-consuming checks, so show is slow for floating-point numbers. By producing a digit-string guaranteed to be long enough to uniquely determine the number without caring whether there's a shorter representation, the display functions of this package can be faster, sometimes by a big margin. Text.FShow.Raw provides building blocks for representations of numeric types which don't belong to RealFloat but have some of its functionality. The bulk of the code is a minor modification of code from the base package, whence the GHC License is included as an extra-source-file.
-
Beautiful Folding This package is a playground full of comonadic folds. This style of fold is documented in "Cellular Automata, Part II: PNGs and Moore" This package can be seen as what happens if you chase Max Rabkin's "Beautiful Folding" to its logical conclusion. More information on this approach can be found in the "Another lovely example of type class morphisms" and "More beautiful fold zipping" posts by Conal Elliott, as well as in Gabriel Gonzales' "Composable Streaming Folds"
-
An implementation of forkIO for monad stacks. < This module defines a more generic version of Control.Concurrent's forkIO, which can directly run some complex monadic actions as well as plain IO actions.
-
free categories free categories, paths, and categorical folds
-
Interface to the Kinect device. Interface to the Kinect device. Currently supports depth perception. (No video or audio.)
-
Linear time composable parser for PEG grammars frisby is a parser library that can parse arbitrary PEG grammars in linear time. Unlike other parsers of PEG grammars, frisby need not be supplied with all possible rules up front, allowing composition of smaller parsers. . PEG parsers are never ambiguous and allow infinite lookahead with no backtracking penalty. Since PEG parsers can look ahead arbitrarily, they can easily express rules such as the maximal munch rule used in lexers, meaning no separate lexer is needed. . In addition to many standard combinators, frisby provides routines to translate standard regex syntax into frisby parsers.
-
Functional MetaPost is a Haskell frontend to the MetaPost language Functional MetaPost is a Haskell frontend to the MetaPost language by John Hobby. Users write their graphics as Haskell programs, which then emit MetaPost code that can be compiled into encapsulated PostScript files and smoothly included into e.g. LaTeX. A collection of useful examples how to use Functional MetaPost can be found in the user's manual. The document doesn't offer very much detail in terms of explanations, but the code samples are quite helpful. Further documentation can be found in the original thesis that describes the implementation. The text is also available in German. Last but not least, there is a tutorial that offers many helpful examples (which is also available in German).
-
Derivation of Aeson instances using GHC generics. Derivation of Aeson instances using GHC generics.
package
generic-data-functions Familiar functions lifted to generic data types Please see README.md.
-
Generically derived enumerations. This package provides a way to generically obtain every possible value of a type, provided that the generic representation of the type is compatible.