partial-isomorphisms

Partial isomorphisms.

http://www.informatik.uni-marburg.de/~rendel/unparse

Version on this page:	0.2.2.1
LTS Haskell 24.17:	0.2.4.0
Stackage Nightly 2025-11-01:	0.2.4.0
Latest on Hackage:	0.2.4.0

See all snapshots partial-isomorphisms appears in

BSD-3-Clause licensed by Tillmann Rendel

Maintained by Tillmann Rendel <[email protected]> Stanislav Chernichkin

This version can be pinned in stack with:partial-isomorphisms-0.2.2.1@sha256:56c9fe5f7f670380f5df65ea4686bde6acc8bae8160ef8bd3b25cac20ed3bd85,1917

Module documentation for 0.2.2.1

Control
- Control.Isomorphism
  - Control.Isomorphism.Partial
    - Control.Isomorphism.Partial.Constructors
    - Control.Isomorphism.Partial.Derived
    - Control.Isomorphism.Partial.Prim
    - Control.Isomorphism.Partial.TH
    - Control.Isomorphism.Partial.Unsafe

Depends on 2 packages(full list with versions):

base, template-haskell

Used by 1 package in nightly-2018-01-25(full list with versions):

invertible

Partial isomorphisms as described in the paper:

Tillmann Rendel and Klaus Ostermann. Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing. In Proc. of Haskell Symposium, 2010.

The paper also describes invertible syntax descriptions as a common interface for parsers and pretty printers. These are distributed separately in the invertible-syntax package.