Symantic.Parser.Haskell.Term

Haskell terms which are interesting to pattern-match when optimizing.

Class Termable

class Termable repr where

Single-out some Haskell terms in order to

Minimal complete definition

Nothing

Methods

(.@) :: repr (a -> b) -> repr a -> repr b infixl 9

Application, aka. unabstract.

lam :: (repr a -> repr b) -> repr (a -> b)

Lambda term abstraction, in HOAS (Higher-Order Abstract Syntax) style.

lam1 :: (repr a -> repr b) -> repr (a -> b)

Like lam but whose argument is used only once, hence safe to beta-reduce (inline) without duplicating work.

bool :: Bool -> repr Bool

char :: (Lift tok, Show tok) => tok -> repr tok

cons :: repr (a -> [a] -> [a])

nil :: repr [a]

eq :: Eq a => repr (a -> a -> Bool)

unit :: repr ()

left :: repr (l -> Either l r)

right :: repr (r -> Either l r)

nothing :: repr (Maybe a)

just :: repr (a -> Maybe a)

const :: repr (a -> b -> a)

flip :: repr ((a -> b -> c) -> b -> a -> c)

id :: repr (a -> a)

(.) :: repr ((b -> c) -> (a -> b) -> a -> c) infixr 9

($) :: repr ((a -> b) -> a -> b) infixr 0

(.@) :: Liftable2 repr => Termable (Output repr) => repr (a -> b) -> repr a -> repr b infixl 9

Application, aka. unabstract.

lam :: Liftable repr => Unliftable repr => Termable (Output repr) => (repr a -> repr b) -> repr (a -> b)

Lambda term abstraction, in HOAS (Higher-Order Abstract Syntax) style.

lam1 :: Liftable repr => Unliftable repr => Termable (Output repr) => (repr a -> repr b) -> repr (a -> b)

Like lam but whose argument is used only once, hence safe to beta-reduce (inline) without duplicating work.

bool :: Liftable repr => Termable (Output repr) => Bool -> repr Bool

char :: Liftable repr => Termable (Output repr) => Lift tok => Show tok => tok -> repr tok

cons :: Liftable repr => Termable (Output repr) => repr (a -> [a] -> [a])

nil :: Liftable repr => Termable (Output repr) => repr [a]

eq :: Liftable repr => Termable (Output repr) => Eq a => repr (a -> a -> Bool)

unit :: Liftable repr => Termable (Output repr) => repr ()

left :: Liftable repr => Termable (Output repr) => repr (l -> Either l r)

right :: Liftable repr => Termable (Output repr) => repr (r -> Either l r)

nothing :: Liftable repr => Termable (Output repr) => repr (Maybe a)

just :: Liftable repr => Termable (Output repr) => repr (a -> Maybe a)

const :: Liftable repr => Termable (Output repr) => repr (a -> b -> a)

flip :: Liftable repr => Termable (Output repr) => repr ((a -> b -> c) -> b -> a -> c)

id :: Liftable repr => Termable (Output repr) => repr (a -> a)

(.) :: Liftable repr => Termable (Output repr) => repr ((b -> c) -> (a -> b) -> a -> c) infixr 9

($) :: Liftable repr => Termable (Output repr) => repr ((a -> b) -> a -> b) infixr 0

Instances

Termable Identity

Defined in Symantic.Parser.Haskell.Term

Methods

(.@) :: Identity (a -> b) -> Identity a -> Identity b

lam :: (Identity a -> Identity b) -> Identity (a -> b)

lam1 :: (Identity a -> Identity b) -> Identity (a -> b)

bool :: Bool -> Identity Bool

char :: (Lift tok, Show tok) => tok -> Identity tok

cons :: Identity (a -> [a] -> [a])

nil :: Identity [a]

eq :: Eq a => Identity (a -> a -> Bool)

unit :: Identity ()

left :: Identity (l -> Either l r)

right :: Identity (r -> Either l r)

nothing :: Identity (Maybe a)

just :: Identity (a -> Maybe a)

const :: Identity (a -> b -> a)

flip :: Identity ((a -> b -> c) -> b -> a -> c)

id :: Identity (a -> a)

(.) :: Identity ((b -> c) -> (a -> b) -> a -> c)

($) :: Identity ((a -> b) -> a -> b)

Termable ValueCode

Defined in Symantic.Parser.Haskell.Term

Methods

(.@) :: ValueCode (a -> b) -> ValueCode a -> ValueCode b

lam :: (ValueCode a -> ValueCode b) -> ValueCode (a -> b)

lam1 :: (ValueCode a -> ValueCode b) -> ValueCode (a -> b)

bool :: Bool -> ValueCode Bool

char :: (Lift tok, Show tok) => tok -> ValueCode tok

cons :: ValueCode (a -> [a] -> [a])

nil :: ValueCode [a]

eq :: Eq a => ValueCode (a -> a -> Bool)

unit :: ValueCode ()

left :: ValueCode (l -> Either l r)

right :: ValueCode (r -> Either l r)

nothing :: ValueCode (Maybe a)

just :: ValueCode (a -> Maybe a)

const :: ValueCode (a -> b -> a)

flip :: ValueCode ((a -> b -> c) -> b -> a -> c)

id :: ValueCode (a -> a)

(.) :: ValueCode ((b -> c) -> (a -> b) -> a -> c)

($) :: ValueCode ((a -> b) -> a -> b)

Termable (CodeQ :: Type -> Type)

Defined in Symantic.Parser.Haskell.Term

Methods

(.@) :: CodeQ (a -> b) -> CodeQ a -> CodeQ b

lam :: (CodeQ a -> CodeQ b) -> CodeQ (a -> b)

lam1 :: (CodeQ a -> CodeQ b) -> CodeQ (a -> b)

bool :: Bool -> CodeQ Bool

char :: (Lift tok, Show tok) => tok -> CodeQ tok

cons :: CodeQ (a -> [a] -> [a])

nil :: CodeQ [a]

eq :: Eq a => CodeQ (a -> a -> Bool)

unit :: CodeQ ()

left :: CodeQ (l -> Either l r)

right :: CodeQ (r -> Either l r)

nothing :: CodeQ (Maybe a)

just :: CodeQ (a -> Maybe a)

const :: CodeQ (a -> b -> a)

flip :: CodeQ ((a -> b -> c) -> b -> a -> c)

id :: CodeQ (a -> a)

(.) :: CodeQ ((b -> c) -> (a -> b) -> a -> c)

($) :: CodeQ ((a -> b) -> a -> b)

Termable repr => Termable (Term repr)

Defined in Symantic.Parser.Haskell.Optimize

Methods

(.@) :: Term repr (a -> b) -> Term repr a -> Term repr b

lam :: (Term repr a -> Term repr b) -> Term repr (a -> b)

lam1 :: (Term repr a -> Term repr b) -> Term repr (a -> b)

bool :: Bool -> Term repr Bool

char :: (Lift tok, Show tok) => tok -> Term repr tok

cons :: Term repr (a -> [a] -> [a])

nil :: Term repr [a]

eq :: Eq a => Term repr (a -> a -> Bool)

unit :: Term repr ()

left :: Term repr (l -> Either l r)

right :: Term repr (r -> Either l r)

nothing :: Term repr (Maybe a)

just :: Term repr (a -> Maybe a)

const :: Term repr (a -> b -> a)

flip :: Term repr ((a -> b -> c) -> b -> a -> c)

id :: Term repr (a -> a)

(.) :: Term repr ((b -> c) -> (a -> b) -> a -> c)

($) :: Term repr ((a -> b) -> a -> b)

Type ValueCode

data ValueCode a

Constructors

ValueCode

Fields

• value :: a
• code :: CodeQ a

Instances

Termable ValueCode

Defined in Symantic.Parser.Haskell.Term

Methods

(.@) :: ValueCode (a -> b) -> ValueCode a -> ValueCode b

lam :: (ValueCode a -> ValueCode b) -> ValueCode (a -> b)

lam1 :: (ValueCode a -> ValueCode b) -> ValueCode (a -> b)

bool :: Bool -> ValueCode Bool

char :: (Lift tok, Show tok) => tok -> ValueCode tok

cons :: ValueCode (a -> [a] -> [a])

nil :: ValueCode [a]

eq :: Eq a => ValueCode (a -> a -> Bool)

unit :: ValueCode ()

left :: ValueCode (l -> Either l r)

right :: ValueCode (r -> Either l r)

nothing :: ValueCode (Maybe a)

just :: ValueCode (a -> Maybe a)

const :: ValueCode (a -> b -> a)

flip :: ValueCode ((a -> b -> c) -> b -> a -> c)

id :: ValueCode (a -> a)

(.) :: ValueCode ((b -> c) -> (a -> b) -> a -> c)

($) :: ValueCode ((a -> b) -> a -> b)

Trans (Term ValueCode) ValueCode

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: Term ValueCode a -> ValueCode a

Trans (Term (CodeQ :: Type -> Type)) (Term ValueCode)

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: Term CodeQ a -> Term ValueCode a

Trans (Term ValueCode) (Term (CodeQ :: Type -> Type))

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: Term ValueCode a -> Term CodeQ a