Data.Reflection.Internal

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

Methods

reflect :: proxy (s a) -> a

Instances

ReifiedStorable s => Reified (Stable s)

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

reflectT :: Reified s => t s a -> a

Special cases

Reifying integral values as types

class ReifiedNum s where

Methods

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

Instances

ReifiedNum Zero

ReifiedNum s => ReifiedNum (Pred s)

ReifiedNum s => ReifiedNum (Succ s)

ReifiedNum s => ReifiedNum (Twice s)

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

Reifying lists of integrals values as types

class ReifiedNums ss where

Methods

reflectNums :: Num a => proxy ss -> [a]

Instances

ReifiedNums Nil

(ReifiedNum s, ReifiedNums ss) => ReifiedNums (Cons s ss)

reifyIntegrals :: Integral a => [a] -> (forall ss. ReifiedNums ss => Proxy ss -> w) -> w

Reifying storables values as types

class ReifiedStorable s where

Methods

reflectStorable :: Storable a => proxy (s a) -> a

Instances

ReifiedNums s => ReifiedStorable (Store s)

reifyStorable :: Storable a => a -> (forall s. ReifiedStorable s => Proxy (s a) -> w) -> w