Symantic.Univariant.Letable

Class Letable

class Letable letName repr where

This class is not for manual usage like usual symantic operators, here def and ref are introduced by observeSharing.

Minimal complete definition

Nothing

Methods

def :: letName -> repr a -> repr a

(def letName x) let-binds (letName) to be equal to (x).

ref :: Bool -> letName -> repr a

(ref isRec letName) is a reference to (letName). (isRec) is True iif. this reference is recursive, ie. is reachable within its definition.

def :: Liftable1 repr => Letable letName (Output repr) => letName -> repr a -> repr a

(def letName x) let-binds (letName) to be equal to (x).

ref :: Liftable repr => Letable letName (Output repr) => Bool -> letName -> repr a

(ref isRec letName) is a reference to (letName). (isRec) is True iif. this reference is recursive, ie. is reachable within its definition.

Instances

Show letName => Letable letName WriteComb

Defined in Symantic.Parser.Grammar.Write

Methods

def :: letName -> WriteComb a -> WriteComb a

ref :: Bool -> letName -> WriteComb a

Show letName => Letable letName DumpComb

Defined in Symantic.Parser.Grammar.Dump

Methods

def :: letName -> DumpComb a -> DumpComb a

ref :: Bool -> letName -> DumpComb a

Letable Name (Comb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

def :: Name -> Comb repr a -> Comb repr a

ref :: Bool -> Name -> Comb repr a

Letable Name (Machine inp)

Defined in Symantic.Parser.Machine.Instructions

Methods

def :: Name -> Machine inp a -> Machine inp a

ref :: Bool -> Name -> Machine inp a

(Letable letName repr, Eq letName, Hashable letName) => Letable letName (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

def :: letName -> CleanDefs letName repr a -> CleanDefs letName repr a

ref :: Bool -> letName -> CleanDefs letName repr a

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Letable letName (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

def :: letName -> ObserveSharing letName repr a -> ObserveSharing letName repr a

ref :: Bool -> letName -> ObserveSharing letName repr a

Letable letName (Comb repr) => Letable letName (OptimizeComb letName repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

def :: letName -> OptimizeComb letName repr a -> OptimizeComb letName repr a

ref :: Bool -> letName -> OptimizeComb letName repr a

Class MakeLetName

class MakeLetName letName where

Methods

makeLetName :: SharingName -> IO letName

Instances

MakeLetName Name

Defined in Symantic.Parser.Grammar.Optimize

Methods

makeLetName :: SharingName -> IO Name

Type SharingName

data SharingName

Note that the observable sharing enabled by StableName is not perfect as it will not observe all the sharing explicitely done.

Note also that the observed sharing could be different between ghc and ghci.

Constructors

SharingName (StableName a)

Instances

Eq SharingName

Defined in Symantic.Univariant.Letable

Methods

(==) :: SharingName -> SharingName -> Bool

(/=) :: SharingName -> SharingName -> Bool

Hashable SharingName

Defined in Symantic.Univariant.Letable

Methods

hashWithSalt :: Int -> SharingName -> Int

hash :: SharingName -> Int

makeSharingName :: a -> SharingName

(makeSharingName x) is like (makeStableName x) but it also forces evaluation of (x) to ensure that the StableName is correct first time, which avoids to produce a tree bigger than needed.

Note that this function uses unsafePerformIO instead of returning in IO, this is apparently required to avoid infinite loops due to unstable StableName in compiled code, and sometimes also in ghci.

Note that maybe pseq should be used here.

Type ObserveSharing

newtype ObserveSharing letName repr a

Interpreter detecting some (Haskell embedded) let definitions used at least once and/or recursively, in order to replace them with the def and ref combinators. See Type-safe observable sharing in Haskell

Constructors

ObserveSharing

Fields

• unObserveSharing :: ReaderT (HashSet SharingName) (State (ObserveSharingState letName)) (CleanDefs letName repr a)

Instances

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Letable letName (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

def :: letName -> ObserveSharing letName repr a -> ObserveSharing letName repr a

ref :: Bool -> letName -> ObserveSharing letName repr a

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Lookable repr) => Lookable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

look :: ObserveSharing letName repr a -> ObserveSharing letName repr a

negLook :: ObserveSharing letName repr a -> ObserveSharing letName repr ()

eof :: ObserveSharing letName repr ()

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Foldable repr, Applicable repr, Alternable repr) => Foldable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

chainPre :: ObserveSharing letName repr (a -> a) -> ObserveSharing letName repr a -> ObserveSharing letName repr a

chainPost :: ObserveSharing letName repr a -> ObserveSharing letName repr (a -> a) -> ObserveSharing letName repr a

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Matchable repr) => Matchable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [ObserveSharing letName repr b] -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr b

match :: Eq a => [Haskell a] -> ObserveSharing letName repr a -> (Haskell a -> ObserveSharing letName repr b) -> ObserveSharing letName repr b -> ObserveSharing letName repr b

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Selectable repr) => Selectable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

branch :: ObserveSharing letName repr (Either a b) -> ObserveSharing letName repr (a -> c) -> ObserveSharing letName repr (b -> c) -> ObserveSharing letName repr c

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Alternable repr) => Alternable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<|>) :: ObserveSharing letName repr a -> ObserveSharing letName repr a -> ObserveSharing letName repr a

empty :: ObserveSharing letName repr a

try :: ObserveSharing letName repr a -> ObserveSharing letName repr a

(<+>) :: (Applicable (ObserveSharing letName repr), Alternable (ObserveSharing letName repr)) => ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr (Either a b)

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Applicable repr) => Applicable (ObserveSharing letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<$>) :: Haskell (a -> b) -> ObserveSharing letName repr a -> ObserveSharing letName repr b

(<&>) :: ObserveSharing letName repr a -> Haskell (a -> b) -> ObserveSharing letName repr b

(<$) :: Haskell a -> ObserveSharing letName repr b -> ObserveSharing letName repr a

($>) :: ObserveSharing letName repr a -> Haskell b -> ObserveSharing letName repr b

pure :: Haskell a -> ObserveSharing letName repr a

(<*>) :: ObserveSharing letName repr (a -> b) -> ObserveSharing letName repr a -> ObserveSharing letName repr b

liftA2 :: Haskell (a -> b -> c) -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr c

(<*) :: ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr a

(*>) :: ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr b

(<**>) :: ObserveSharing letName repr a -> ObserveSharing letName repr (a -> b) -> ObserveSharing letName repr b

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName, Satisfiable repr tok) => Satisfiable (ObserveSharing letName repr) tok

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> ObserveSharing letName repr tok

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans3 (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans3 :: (CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c -> CleanDefs letName repr d) -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr c -> ObserveSharing letName repr d

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans2 (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans2 :: (CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c) -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr c

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans1 (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans1 :: (CleanDefs letName repr a -> CleanDefs letName repr b) -> ObserveSharing letName repr a -> ObserveSharing letName repr b

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans :: CleanDefs letName repr a -> ObserveSharing letName repr a

type Output (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

type Output (ObserveSharing letName repr) = CleanDefs letName repr

observeSharing :: Eq letName => Hashable letName => ObserveSharing letName repr a -> repr a

Type ObserveSharingState

data ObserveSharingState letName

Constructors

ObserveSharingState

Fields

• oss_refs :: HashMap SharingName (letName, Int)
• oss_recs :: HashSet SharingName

  TODO: unused so far, will it be useful somewhere at a later stage?

observeSharingNode :: Eq letName => Hashable letName => Letable letName repr => MakeLetName letName => ObserveSharing letName repr a -> ObserveSharing letName repr a

Type CleanDefs

newtype CleanDefs letName repr a

Remove def when non-recursive or unused.

Constructors

CleanDefs

Fields

• unCleanDefs :: HashSet letName -> repr a

Instances

Trans3 repr (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans3 :: (repr a -> repr b -> repr c -> repr d) -> CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c -> CleanDefs letName repr d

Trans2 repr (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans2 :: (repr a -> repr b -> repr c) -> CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c

Trans1 repr (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans1 :: (repr a -> repr b) -> CleanDefs letName repr a -> CleanDefs letName repr b

Trans repr (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans :: repr a -> CleanDefs letName repr a

(Letable letName repr, Eq letName, Hashable letName) => Letable letName (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

def :: letName -> CleanDefs letName repr a -> CleanDefs letName repr a

ref :: Bool -> letName -> CleanDefs letName repr a

Lookable repr => Lookable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

look :: CleanDefs letName repr a -> CleanDefs letName repr a

negLook :: CleanDefs letName repr a -> CleanDefs letName repr ()

eof :: CleanDefs letName repr ()

Foldable repr => Foldable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

chainPre :: CleanDefs letName repr (a -> a) -> CleanDefs letName repr a -> CleanDefs letName repr a

chainPost :: CleanDefs letName repr a -> CleanDefs letName repr (a -> a) -> CleanDefs letName repr a

Matchable repr => Matchable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

conditional :: Eq a => [Haskell (a -> Bool)] -> [CleanDefs letName repr b] -> CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr b

match :: Eq a => [Haskell a] -> CleanDefs letName repr a -> (Haskell a -> CleanDefs letName repr b) -> CleanDefs letName repr b -> CleanDefs letName repr b

Selectable repr => Selectable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

branch :: CleanDefs letName repr (Either a b) -> CleanDefs letName repr (a -> c) -> CleanDefs letName repr (b -> c) -> CleanDefs letName repr c

Alternable repr => Alternable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<|>) :: CleanDefs letName repr a -> CleanDefs letName repr a -> CleanDefs letName repr a

empty :: CleanDefs letName repr a

try :: CleanDefs letName repr a -> CleanDefs letName repr a

(<+>) :: (Applicable (CleanDefs letName repr), Alternable (CleanDefs letName repr)) => CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr (Either a b)

Applicable repr => Applicable (CleanDefs letName repr)

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

(<$>) :: Haskell (a -> b) -> CleanDefs letName repr a -> CleanDefs letName repr b

(<&>) :: CleanDefs letName repr a -> Haskell (a -> b) -> CleanDefs letName repr b

(<$) :: Haskell a -> CleanDefs letName repr b -> CleanDefs letName repr a

($>) :: CleanDefs letName repr a -> Haskell b -> CleanDefs letName repr b

pure :: Haskell a -> CleanDefs letName repr a

(<*>) :: CleanDefs letName repr (a -> b) -> CleanDefs letName repr a -> CleanDefs letName repr b

liftA2 :: Haskell (a -> b -> c) -> CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c

(<*) :: CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr a

(*>) :: CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr b

(<**>) :: CleanDefs letName repr a -> CleanDefs letName repr (a -> b) -> CleanDefs letName repr b

Satisfiable repr tok => Satisfiable (CleanDefs letName repr) tok

Defined in Symantic.Parser.Grammar.ObserveSharing

Methods

satisfy :: [ErrorItem tok] -> Haskell (tok -> Bool) -> CleanDefs letName repr tok

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans3 (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans3 :: (CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c -> CleanDefs letName repr d) -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr c -> ObserveSharing letName repr d

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans2 (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans2 :: (CleanDefs letName repr a -> CleanDefs letName repr b -> CleanDefs letName repr c) -> ObserveSharing letName repr a -> ObserveSharing letName repr b -> ObserveSharing letName repr c

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans1 (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans1 :: (CleanDefs letName repr a -> CleanDefs letName repr b) -> ObserveSharing letName repr a -> ObserveSharing letName repr b

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Trans (CleanDefs letName repr) (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

trans :: CleanDefs letName repr a -> ObserveSharing letName repr a

type Output (CleanDefs _letName repr)

Defined in Symantic.Univariant.Letable

type Output (CleanDefs _letName repr) = repr