RepLib-0.2.1: Generic programming library with representation types Source code Contents Index

Data.RepLib.PreludeReps Portability non-portable Stability experimental Maintainer sweirich@cis.upenn.edu

Description

Automatically derive representations for prelude types

Documentation

rBool1 :: forall ctx[a70m]. R1 ctx[a70m] Bool Source

rBool :: R Bool Source

rMaybe1 :: forall ctx[a70c] a[a1ko]. Rep a[a1ko] => ctx[a70c] a[a1ko] -> R1 ctx[a70c] (Maybe a[a1ko]) Source

rMaybe :: forall a[a1ko]. Rep a[a1ko] => R (Maybe a[a1ko]) Source

rEither1 :: forall ctx[a6ZX] a[a6ZO] b[a6ZN]. (Rep a[a6ZO], Rep b[a6ZN]) => ctx[a6ZX] a[a6ZO] -> ctx[a6ZX] b[a6ZN] -> R1 ctx[a6ZX] (Either a[a6ZO] b[a6ZN]) Source

rEither :: forall a[a6ZO] b[a6ZN]. (Rep a[a6ZO], Rep b[a6ZN]) => R (Either a[a6ZO] b[a6ZN]) Source

rOrdering1 :: forall ctx[a6ZG]. R1 ctx[a6ZG] Ordering Source

rOrdering :: R Ordering Source

rTup3_1 :: forall ctx[a6Zo] a[12] b[13] c[14]. (Rep a[12], Rep b[13], Rep c[14]) => ctx[a6Zo] a[12] -> ctx[a6Zo] b[13] -> ctx[a6Zo] c[14] -> R1 ctx[a6Zo] ((,,) a[12] b[13] c[14]) Source

rTup3 :: forall a[12] b[13] c[14]. (Rep a[12], Rep b[13], Rep c[14]) => R ((,,) a[12] b[13] c[14]) Source

rTup4_1 :: forall ctx[a6Z1] a[12] b[13] c[14] d[15]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15]) => ctx[a6Z1] a[12] -> ctx[a6Z1] b[13] -> ctx[a6Z1] c[14] -> ctx[a6Z1] d[15] -> R1 ctx[a6Z1] ((,,,) a[12] b[13] c[14] d[15]) Source

rTup4 :: forall a[12] b[13] c[14] d[15]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15]) => R ((,,,) a[12] b[13] c[14] d[15]) Source

rTup5_1 :: forall ctx[a6Yz] a[12] b[13] c[14] d[15] e[16]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15], Rep e[16]) => ctx[a6Yz] a[12] -> ctx[a6Yz] b[13] -> ctx[a6Yz] c[14] -> ctx[a6Yz] d[15] -> ctx[a6Yz] e[16] -> R1 ctx[a6Yz] ((,,,,) a[12] b[13] c[14] d[15] e[16]) Source

rTup5 :: forall a[12] b[13] c[14] d[15] e[16]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15], Rep e[16]) => R ((,,,,) a[12] b[13] c[14] d[15] e[16]) Source

rTup6_1 :: forall ctx[a6Y2] a[12] b[13] c[14] d[15] e[16] f[17]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15], Rep e[16], Rep f[17]) => ctx[a6Y2] a[12] -> ctx[a6Y2] b[13] -> ctx[a6Y2] c[14] -> ctx[a6Y2] d[15] -> ctx[a6Y2] e[16] -> ctx[a6Y2] f[17] -> R1 ctx[a6Y2] ((,,,,,) a[12] b[13] c[14] d[15] e[16] f[17]) Source

rTup6 :: forall a[12] b[13] c[14] d[15] e[16] f[17]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15], Rep e[16], Rep f[17]) => R ((,,,,,) a[12] b[13] c[14] d[15] e[16] f[17]) Source

rTup7_1 :: forall ctx[a6Xq] a[12] b[13] c[14] d[15] e[16] f[17] g[18]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15], Rep e[16], Rep f[17], Rep g[18]) => ctx[a6Xq] a[12] -> ctx[a6Xq] b[13] -> ctx[a6Xq] c[14] -> ctx[a6Xq] d[15] -> ctx[a6Xq] e[16] -> ctx[a6Xq] f[17] -> ctx[a6Xq] g[18] -> R1 ctx[a6Xq] ((,,,,,,) a[12] b[13] c[14] d[15] e[16] f[17] g[18]) Source

rTup7 :: forall a[12] b[13] c[14] d[15] e[16] f[17] g[18]. (Rep a[12], Rep b[13], Rep c[14], Rep d[15], Rep e[16], Rep f[17], Rep g[18]) => R ((,,,,,,) a[12] b[13] c[14] d[15] e[16] f[17] g[18]) Source

Produced by Haddock version 2.4.2