Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
An implementation of the C99 AST that strictly follows the standard. This package contains an implementation of the C99 AST as described in http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1256.pdf. Sticking closely to this standard assures us that the program we deal with is a valid C99 program. Additionally the library comes with a pretty printer. The package does not come with handy wrapper and utility functions to write a C99 program, it just contains the bare AST. It is highly recommended to use the wrapper provided by 'language-c99-simple' and 'language-c99-util' for writing programs.
-
Parser for JavaScript Parses Javascript into an Abstract Syntax Tree (AST). Initially intended as frontend to hjsmin. Note: Version 0.5.0 breaks compatibility with prior versions, the AST has been reworked to allow round trip processing of JavaScript.
-
Data types and functions to represent the Nix language Data types and useful functions to represent and manipulate the Nix language.
-
Auto-generated interface to Fortran LAPACK LAPACK is a package for efficient numerically robust linear algebra. The original implementation is written in FORTRAN. This is an automatically generated low-level wrapper. We provide bindings to functions of all variants for Float, Double, Complex Float and Complex Double. We do not use TemplateHaskell nor HSC nor CHS, but instead Haskell 98 code generated by the custom lapack-ffi-tools package.
-
LEB128 and SLEB128 encoding This module implements encoding and decoding of Natural and Integer values according to LEB128 and SLEB128. See https://en.wikipedia.org/wiki/LEB128 for a specification. This package uses the cereal package, but also provides direct encoding and decoding to ByteString.
-
Monadic Getters and Folds This package contains combinators and types for working with monadic getters and folds as split off from the original lens package.
-
Lift a type from a Typeable constraint to a Template Haskell type Lift your types from a Typeable constraint to a Template Haskell type
-
Standard library for linear types. Please see README.md.
-
Generic programming library for generalised deriving. This package offers a version of GHC.Generics with two important improvements:
- The to, from, to1, and from1 methods have multiplicity-polymorphic types, allowing them to be used with either traditional Haskell code or linearly typed code.
- The representations used for Generic1 are modified slightly. As a result, to1 and from1 never need to use fmap. This can greatly improve performance, and it is necessary to support multiplicity polymorphism. A smaller change, approximately as proposed by spl, reduces the number of instances that must be written to actually use Generic1 for deriving instances of other classes.
- A generic deriving mechanism for Haskell. Jose Pedro Magalhaes, Atze Dijkstra, Johan Jeuring, and Andres Loeh. Haskell'10.
- Generics.Linear defines the core functionality for generics, including the multiplicity-polymorphic Generic(1) classes and a replacement for the :.: composition type.
- Generics.Linear.TH implements Template Haskell functionality for deriving instances of Generic(1).
- Generics.Linear.Unsafe.ViaGHCGenerics offers DerivingVia targets to derive Generic and Generic1 instances from GHC.Generics.GHC.Generics.Generic. Because these instances necessarily use unsafe coercions, their use will likely inhibit full optimization of code using them.
-
Linear Programming basic definitions Basic types and generic functions for use in the packages coinor-clp and comfort-glpk.