Symantic.Parser.Haskell.Optimize

Type Term

data Term repr a where

Initial encoding of some Termable symantics, useful for some optimizations in optimizeTerm.

Constructors

Term

Black-box for all terms neither interpreted nor pattern-matched.

Fields

• :: { unTerm :: repr a
•    } -> Term repr a

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

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

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

Var :: String -> Term repr a

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

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

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

Instances

Trans repr (Term repr)

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: repr a -> Term repr a

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)

Trans (Term Identity) Identity

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: Term Identity a -> Identity a

Trans (Term ValueCode) ValueCode

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: Term ValueCode a -> ValueCode a

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

Defined in Symantic.Parser.Haskell.Optimize

Methods

trans :: Term CodeQ a -> CodeQ 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

Show (Term repr a)

Defined in Symantic.Parser.Haskell.View

Methods

showsPrec :: Int -> Term repr a -> ShowS

show :: Term repr a -> String

showList :: [Term repr a] -> ShowS

type Output (Term repr)

Defined in Symantic.Parser.Haskell.Optimize

type Output (Term repr) = repr

optimizeTerm :: Term repr a -> Term repr a

Beta-reduce the left-most outer-most lambda abstraction (aka. normal-order reduction), but to avoid duplication of work, only those manually marked as using their variable at most once. This is mainly to get prettier splices.

DOC: Demonstrating Lambda Calculus Reduction, Peter Sestoft, 2001, https://www.itu.dk/people/sestoft/papers/sestoft-lamreduce.pdf