syb

Scrap Your Boilerplate

http://www.cs.uu.nl/wiki/GenericProgramming/SYB

Version on this page:0.7.2.3
LTS Haskell 22.39:0.7.2.4
Stackage Nightly 2024-10-31:0.7.2.4
Latest on Hackage:0.7.2.4

See all snapshots syb appears in

BSD-3-Clause licensed by Ralf Lammel, Simon Peyton Jones, Jose Pedro Magalhaes
Maintained by Sergey Vinokurov
This version can be pinned in stack with:syb-0.7.2.3@sha256:d71f6747016466b0766491eae36be842ba98ba25e2aec26eaedbeea965c0586a,3889

Module documentation for 0.7.2.3

Depends on 1 package(full list with versions):
base

syb: Scrap Your Boilerplate!

Scrap Your Boilerplate (SYB) is a library for generic programming in Haskell. It is supported since the GHC >= 6.0 implementation of Haskell. Using this approach, you can write generic functions such as traversal schemes (e.g., everywhere and everything), as well as generic read, generic show and generic equality (i.e., gread, gshow, and geq). This approach is based on just a few primitives for type-safe cast and processing constructor applications.

It was originally developed by Ralf Lämmel and Simon Peyton Jones. Since then, many people have contributed with research relating to SYB or its applications.

More information is available on the webpage: http://www.cs.uu.nl/wiki/GenericProgramming/SYB

Features

  • Easy generic programming with combinators
  • GHC can derive Data and Typeable instances for your datatypes
  • Comes with many useful generic functions

Requirements

  • GHC 6.10.1 or later
  • Cabal 1.6 or later

Bugs & Support

Please report issues or request features at the bug tracker:

https://github.com/dreixel/syb/issues

For discussion about the library with the authors, maintainers, and other interested persons use the mailing list:

http://www.haskell.org/mailman/listinfo/generics

Changes

0.7.2.3

  • Compatibility with mtl 2.3 and GHC 9.6

0.7.2.2

  • Compatibility with GHC 9.4

0.7.2.1

  • Update cabal version

0.7.2

  • Add compatibility with GHC 9, switch to tasty for tests, fix tests on GHCJS

0.7.1

  • Define recursive traversals in two parts, non-recursive wrapper and recursive local helper to facilitate inlining and avoid passing the same argument to all recursive calls