Data.Reflection

Based on the Functional Pearl: Implicit Configurations paper by Oleg Kiselyov and Chung-chieh Shan.

http://www.cs.rutgers.edu/~ccshan/prepose/prepose.pdf

Modified to minimize extensions and work with Data.Proxy rather than explicit scoped type variables and undefined values by Edward Kmett.

Reifying any term at the type level

class Reified s where

Associated Types

type Reflected s

Methods

reflect :: p s -> Reflected s

Instances

ReifiedNum s => Reified (Stable s a)

reify :: a -> (forall s. (Reified s, Reflected s ~ a) => Proxy s -> w) -> w

Reifying integral values at the type level

class ReifiedNum s where

Methods

reflectNum :: Num a => p s -> a

Instances

ReifiedNum Zero

ReifiedNum s => ReifiedNum (PredTwice s)

ReifiedNum s => ReifiedNum (SuccTwice s)

ReifiedNum s => ReifiedNum (Twice s)

reifyIntegral :: Integral a => a -> (forall s. ReifiedNum s => Proxy s -> w) -> w