Language.Symantic.Interpreting.Dup

Interpreter to duplicate the representation of an expression in order to evaluate it with different interpreters.

NOTE: this is a more verbose, less clear, and maybe less efficient alternative to maintaining the universal polymorphism of term at parsing time as done with Term; it is mainly here for the sake of curiosity.

Documentation

data Dup term1 term2 a

Interpreter's data.

Constructors

Dup

Fields

• dup_1 :: term1 a
• dup_2 :: term2 a

Instances

(Sym_Lambda r1, Sym_Lambda r2) => Sym_Lambda (Dup r1 r2)

Defined in Language.Symantic.Compiling.Term

Methods

apply :: Dup r1 r2 ((a -> b) -> a -> b)

app :: Dup r1 r2 (a -> b) -> Dup r1 r2 a -> Dup r1 r2 b

lam :: (Dup r1 r2 a -> Dup r1 r2 b) -> Dup r1 r2 (a -> b)

let_ :: Dup r1 r2 var -> (Dup r1 r2 var -> Dup r1 r2 res) -> Dup r1 r2 res

lam1 :: (Dup r1 r2 a -> Dup r1 r2 b) -> Dup r1 r2 (a -> b)

qual :: proxy q -> Dup r1 r2 t -> Dup r1 r2 (q #> t)

dup0 :: (cl r, cl s) => (forall term. cl term => term a) -> Dup r s a

dup1 :: (cl r, cl s) => (forall term. cl term => term a -> term b) -> Dup r s a -> Dup r s b

dup2 :: (cl r, cl s) => (forall term. cl term => term a -> term b -> term c) -> Dup r s a -> Dup r s b -> Dup r s c

dup3 :: (cl r, cl s) => (forall term. cl term => term a -> term b -> term c -> term d) -> Dup r s a -> Dup r s b -> Dup r s c -> Dup r s d