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.
-
Parse, format and process LaTeX files Currently the package only provides conversion between LaTeX escape sequences and Unicode characters. It is used in the bibtex package. In the future we might add support for formatting Haskell values in LaTeX markup for automated report generation. See the packages HaTeX for LaTeX document generation and pandoc for document analysis and generation in multiple markup languages.
-
Assert the lawfulness of your typeclass instances. Assert the lawfulness of your typeclass instances.
-
Lawful typeclasses for bidirectional conversion between types
Summary
Lawful typeclasses capturing three patterns of bidirectional mapping and forming a layered hierarchy with an ascending strictness of laws.- Smart constructor
- Canonicalization or lossy conversion
- Isomorphism or lossless conversion
The conversion problem
Have you ever looked for a toString function? How often do you import Data.Text.Lazy only to call its fromStrict? How about importing Data.ByteString.Builder only to call its toLazyByteString and then importing Data.ByteString.Lazy only to call its toStrict? Those all are instances of one pattern. They are conversions between different representations of the same information. Codebases that don't attempt to abstract over this pattern tend to be sprawling with this type of boilerplate. It's noise to the codereader, it's a burden to the implementor and the maintainer.Why another conversion library?
Many libraries exist that approach the conversion problem. However most of them provide lawless typeclasses leaving it up to the author of the instance to define what makes a proper conversion. This results in inconsistencies across instances, their behaviour not being evident to the user and no way to check whether an instance is correct. This library tackles this problem with a lawful typeclass hierarchy, making it evident what any of its instances do and it provides property-tests for you to validate your instances.Prior work and acknowledgements
This library is an offspring of the "isomorphism-class" library, expanding upon the patterns discovered there. Both libraries are maintained letting their designs compete. Some ideas and concepts are also shared with the following libraries: -
A library for demand-driven testing of Haskell programs Lazy SmallCheck is a library for exhaustive, demand-driven testing of Haskell programs. It is based on the idea that if a property holds for a partially-defined input then it must also hold for all fully-defined refinements of the that input. Compared to `eager' input generation as in SmallCheck, Lazy SmallCheck may require significantly fewer test-cases to verify a property for all inputs up to a given depth.
-
Common LeanCheck instances Listable instances for types provided by the Haskell Platform. The current objective is to include all types supported by quickcheck-instances: https://hackage.haskell.org/package/quickcheck-instances
-
Leap seconds announced at library release time. Provides an easy to use static Data.Time.Clock.TAI.LeapSecondTable with the leap seconds announced at library release time.
-
Haskell code for learning physics A library of functions for vector calculus, calculation of electric field, electric flux, magnetic field, and other quantities in classical mechanics, electromagnetic theory, and quantum mechanics.
-
Please see the README on GitHub at https://github.com/ChrisPenner/lens-csv#readme
-
Generate lens-family style lenses (see README.md)
-
Lens powered regular expression lens interface for regex-base. Please see the README on Github at https://github.com/himura/lens-regex#readme