Grisette.IR.SymPrim.Data.Prim.PartialEval.PartialEval

Documentation

type PartialFun a b = a -> Maybe b

type PartialRuleUnary a b = PartialFun (Term a) (Term b)

type TotalRuleUnary a b = Term a -> Term b

type PartialRuleBinary a b c = Term a -> PartialFun (Term b) (Term c)

type TotalRuleBinary a b c = Term a -> Term b -> Term c

totalize :: PartialFun a b -> (a -> b) -> a -> b

totalize2 :: (a -> PartialFun b c) -> (a -> b -> c) -> a -> b -> c

class UnaryPartialStrategy tag a b | tag a -> b where

Methods

extractor :: tag -> Term a -> Maybe a

constantHandler :: tag -> a -> Maybe (Term b)

nonConstantHandler :: tag -> Term a -> Maybe (Term b)

unaryPartial :: forall tag a b. UnaryPartialStrategy tag a b => tag -> PartialRuleUnary a b

class BinaryCommPartialStrategy tag a c | tag a -> c where

Methods

singleConstantHandler :: tag -> a -> Term a -> Maybe (Term c)

class BinaryPartialStrategy tag a b c | tag a b -> c where

Minimal complete definition

extractora, extractorb, allConstantHandler, nonBinaryConstantHandler

Methods

extractora :: tag -> Term a -> Maybe a

extractorb :: tag -> Term b -> Maybe b

allConstantHandler :: tag -> a -> b -> Maybe (Term c)

leftConstantHandler :: tag -> a -> Term b -> Maybe (Term c)

default leftConstantHandler :: (a ~ b, BinaryCommPartialStrategy tag a c) => tag -> a -> Term b -> Maybe (Term c)

rightConstantHandler :: tag -> Term a -> b -> Maybe (Term c)

default rightConstantHandler :: (a ~ b, BinaryCommPartialStrategy tag a c) => tag -> Term a -> b -> Maybe (Term c)

nonBinaryConstantHandler :: tag -> Term a -> Term b -> Maybe (Term c)

binaryPartial :: forall tag a b c. BinaryPartialStrategy tag a b c => tag -> PartialRuleBinary a b c