Lorentz.Zip

Stack zipping.

This module provides functions for flattening stacks into tuples.

Also here we define an instance which turns any instruction, not only lambdas, into a valid value.

Documentation

class ZipInstr (s :: [Type]) where

Zipping stack into tuple and back.

Associated Types

type ZippedStack s :: Type

A type which contains the whole stack zipped.

Methods

zipInstr :: s :-> '[ZippedStack s]

Fold given stack into single value.

unzipInstr :: '[ZippedStack s] :-> s

Unfold given stack from a single value.

Instances

ZipInstr ([] :: [Type])

Defined in Lorentz.Zip

Associated Types

type ZippedStack [] :: Type

Methods

zipInstr :: [] :-> (ZippedStack [] ': [])

unzipInstr :: (ZippedStack [] ': []) :-> []

ZipInstr (a ': ([] :: [Type]))

Defined in Lorentz.Zip

Associated Types

type ZippedStack (a ': []) :: Type

Methods

zipInstr :: (a ': []) :-> (ZippedStack (a ': []) ': [])

unzipInstr :: (ZippedStack (a ': []) ': []) :-> (a ': [])

ZipInstr ((a, b) ': s) => ZipInstr (a ': (b ': s))

Such definition seems the only possible one we can support efficiently.

Defined in Lorentz.Zip

Associated Types

type ZippedStack (a ': (b ': s)) :: Type

Methods

zipInstr :: (a ': (b ': s)) :-> (ZippedStack (a ': (b ': s)) ': [])

unzipInstr :: (ZippedStack (a ': (b ': s)) ': []) :-> (a ': (b ': s))

type ZipInstrs ss = Each '[ZipInstr] ss

Require several stacks to comply ZipInstr constraint.

zippingStack :: ZipInstrs [inp, out] => (inp :-> out) -> Lambda (ZippedStack inp) (ZippedStack out)

Flatten both ends of instruction stack.

unzippingStack :: ZipInstrs [inp, out] => Lambda (ZippedStack inp) (ZippedStack out) -> inp :-> out

Unflatten both ends of instruction stack.

Orphan instances

(ZipInstr inp, ZipInstr out) => IsoValue (inp :-> out)

Associated Types

type ToT (inp :-> out) :: T

Methods

toVal :: (inp :-> out) -> Value (ToT (inp :-> out))

fromVal :: Value (ToT (inp :-> out)) -> inp :-> out