Monad Result Source #
Instance details Defined in Funcons.Operations.Expr Methods (>>=) :: Result a -> (a -> Result b) -> Result b # (>>) :: Result a -> Result b -> Result b # return :: a -> Result a # fail :: String -> Result a #
Functor Result Source #
Instance details Defined in Funcons.Operations.Expr Methods fmap :: (a -> b) -> Result a -> Result b # (<$) :: a -> Result b -> Result a #
Applicative Result Source #
Instance details Defined in Funcons.Operations.Expr Methods pure :: a -> Result a # (<>) :: Result (a -> b) -> Result a -> Result b # liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c # (>) :: Result a -> Result b -> Result b # (<*) :: Result a -> Result b -> Result a #
Show t => Show (Result t) Source #
Instance details Defined in Funcons.Operations.Expr Methods showsPrec :: Int -> Result t -> ShowS # show :: Result t -> String # showList :: [Result t] -> ShowS #

type NullaryOp t = Result t Source #

type UnaryOp t = t -> Result t Source #

type BinaryOp t = t -> t -> Result t Source #

type TernaryOp t = t -> t -> t -> Result t Source #

type NaryOp t = [t] -> Result t Source #

type NullaryVOp t = Result t Source #

type UnaryVOp t = Values t -> Result t Source #

type BinaryVOp t = Values t -> Values t -> Result t Source #

type TernaryVOp t = Values t -> Values t -> Values t -> Result t Source #

type NaryVOp t = [Values t] -> Result t Source #

data OpExpr t Source #

Constructors

ValExpr (Values t)
TermExpr t
NullaryOp OP (NullaryOp t)
UnaryOp OP (UnaryOp t) (OpExpr t)
BinaryOp OP (BinaryOp t) (OpExpr t) (OpExpr t)
TernaryOp OP (TernaryOp t) (OpExpr t) (OpExpr t) (OpExpr t)
NaryOp OP (NaryOp t) [OpExpr t]
InvalidOp OP String [OpExpr t]
RewritesTo OP (OpExpr t) [OpExpr t]

Instances

(HasValues t, Show t) => Show (OpExpr t) Source #
Instance details Defined in Funcons.Operations.Eval Methods showsPrec :: Int -> OpExpr t -> ShowS # show :: OpExpr t -> String # showList :: [OpExpr t] -> ShowS #

vNullaryOp :: OP -> NullaryVOp t -> OpExpr t Source #

vUnaryOp :: HasValues t => OP -> UnaryVOp t -> OpExpr t -> OpExpr t Source #

vBinaryOp :: HasValues t => OP -> BinaryVOp t -> OpExpr t -> OpExpr t -> OpExpr t Source #

vTernaryOp :: HasValues t => OP -> TernaryVOp t -> OpExpr t -> OpExpr t -> OpExpr t -> OpExpr t Source #

vNaryOp :: HasValues t => OP -> NaryVOp t -> [OpExpr t] -> OpExpr t Source #

opName :: OpExpr t -> OP Source #

data ValueOp t Source #

Constructors

NullaryExpr (NullaryExpr t)
UnaryExpr (UnaryExpr t)
BinaryExpr (BinaryExpr t)
TernaryExpr (TernaryExpr t)
NaryExpr (NaryExpr t)

type NullaryExpr t = OpExpr t Source #

type UnaryExpr t = OpExpr t -> OpExpr t Source #

type BinaryExpr t = OpExpr t -> OpExpr t -> OpExpr t Source #

type TernaryExpr t = OpExpr t -> OpExpr t -> OpExpr t -> OpExpr t Source #

type NaryExpr t = [OpExpr t] -> OpExpr t Source #

nullaryOp :: NullaryExpr t -> [OpExpr t] -> OpExpr t Source #

unaryOp :: UnaryExpr t -> [OpExpr t] -> OpExpr t Source #

binaryOp :: BinaryExpr t -> [OpExpr t] -> OpExpr t Source #

ternaryOp :: TernaryExpr t -> [OpExpr t] -> OpExpr t Source #

arityErr :: Int -> OP -> [OpExpr t] -> OpExpr t Source #

applyExpr :: HasValues t => OpExpr t -> Result t Source #

data IEEEFormats Source #

Constructors

Binary32
Binary64

Instances

Enum IEEEFormats Source #
Instance details Defined in Funcons.Operations.Values Methods succ :: IEEEFormats -> IEEEFormats # pred :: IEEEFormats -> IEEEFormats # toEnum :: Int -> IEEEFormats # fromEnum :: IEEEFormats -> Int # enumFrom :: IEEEFormats -> [IEEEFormats] # enumFromThen :: IEEEFormats -> IEEEFormats -> [IEEEFormats] # enumFromTo :: IEEEFormats -> IEEEFormats -> [IEEEFormats] # enumFromThenTo :: IEEEFormats -> IEEEFormats -> IEEEFormats -> [IEEEFormats] #
Eq IEEEFormats Source #
Instance details Defined in Funcons.Operations.Values Methods (==) :: IEEEFormats -> IEEEFormats -> Bool # (/=) :: IEEEFormats -> IEEEFormats -> Bool #
Ord IEEEFormats Source #
Instance details Defined in Funcons.Operations.Values Methods compare :: IEEEFormats -> IEEEFormats -> Ordering # (<) :: IEEEFormats -> IEEEFormats -> Bool # (<=) :: IEEEFormats -> IEEEFormats -> Bool # (>) :: IEEEFormats -> IEEEFormats -> Bool # (>=) :: IEEEFormats -> IEEEFormats -> Bool # max :: IEEEFormats -> IEEEFormats -> IEEEFormats # min :: IEEEFormats -> IEEEFormats -> IEEEFormats #
Read IEEEFormats Source #
Instance details Defined in Funcons.Operations.Values Methods readsPrec :: Int -> ReadS IEEEFormats # readList :: ReadS [IEEEFormats] # readPrec :: ReadPrec IEEEFormats # readListPrec :: ReadPrec [IEEEFormats] #
Show IEEEFormats Source #
Instance details Defined in Funcons.Operations.Values Methods showsPrec :: Int -> IEEEFormats -> ShowS # show :: IEEEFormats -> String # showList :: [IEEEFormats] -> ShowS #

class HasTypes t where Source #

Methods

projectT :: t -> Maybe (Types t) Source #

injectT :: Types t -> t Source #

Instances

HasComputationTypes t => HasTypes t Source #
Instance details Defined in Funcons.Operations.Values Methods projectT :: t -> Maybe (Types t) Source # injectT :: Types t -> t Source #

class HasComputationTypes t where Source #

Methods

projectCT :: t -> Maybe (ComputationTypes t) Source #

injectCT :: ComputationTypes t -> t Source #

Instances

HasValues t => HasComputationTypes t Source #
Instance details Defined in Funcons.Operations.Values Methods projectCT :: t -> Maybe (ComputationTypes t) Source # injectCT :: ComputationTypes t -> t Source #

class HasValues t where Source #

Methods

project :: t -> Maybe (Values t) Source #

inject :: Values t -> t Source #

data Types t Source #

Representation of builtin types.

Constructors

ADTs
ADT Name [t]
AnnotatedType (Types t) SeqSortOp
AsciiCharacters
ISOLatinCharacters
BMPCharacters
Atoms
IntegersFrom Integer
IntegersUpTo Integer
Characters
Complement (Types t)
ComputationTypes
EmptyType
IEEEFloats IEEEFormats
Integers
Intersection (Types t) (Types t)
Naturals
NullType
Rationals
Types
UnicodeCharacters
Union (Types t) (Types t)
Values

Instances

Functor Types Source #
Instance details Defined in Funcons.Operations.Values Methods fmap :: (a -> b) -> Types a -> Types b # (<$) :: a -> Types b -> Types a #
Foldable Types Source #
Instance details Defined in Funcons.Operations.Values Methods fold :: Monoid m => Types m -> m # foldMap :: Monoid m => (a -> m) -> Types a -> m # foldr :: (a -> b -> b) -> b -> Types a -> b # foldr' :: (a -> b -> b) -> b -> Types a -> b # foldl :: (b -> a -> b) -> b -> Types a -> b # foldl' :: (b -> a -> b) -> b -> Types a -> b # foldr1 :: (a -> a -> a) -> Types a -> a # foldl1 :: (a -> a -> a) -> Types a -> a # toList :: Types a -> [a] # null :: Types a -> Bool # length :: Types a -> Int # elem :: Eq a => a -> Types a -> Bool # maximum :: Ord a => Types a -> a # minimum :: Ord a => Types a -> a # sum :: Num a => Types a -> a # product :: Num a => Types a -> a #
Traversable Types Source #
Instance details Defined in Funcons.Operations.Values Methods traverse :: Applicative f => (a -> f b) -> Types a -> f (Types b) # sequenceA :: Applicative f => Types (f a) -> f (Types a) # mapM :: Monad m => (a -> m b) -> Types a -> m (Types b) # sequence :: Monad m => Types (m a) -> m (Types a) #
Eq t => Eq (Types t) Source #
Instance details Defined in Funcons.Operations.Values Methods (==) :: Types t -> Types t -> Bool # (/=) :: Types t -> Types t -> Bool #
Ord t => Ord (Types t) Source #
Instance details Defined in Funcons.Operations.Values Methods compare :: Types t -> Types t -> Ordering # (<) :: Types t -> Types t -> Bool # (<=) :: Types t -> Types t -> Bool # (>) :: Types t -> Types t -> Bool # (>=) :: Types t -> Types t -> Bool # max :: Types t -> Types t -> Types t # min :: Types t -> Types t -> Types t #
Read t => Read (Types t) Source #
Instance details Defined in Funcons.Operations.Values Methods readsPrec :: Int -> ReadS (Types t) # readList :: ReadS [Types t] # readPrec :: ReadPrec (Types t) # readListPrec :: ReadPrec [Types t] #
Show t => Show (Types t) Source #
Instance details Defined in Funcons.Operations.Values Methods showsPrec :: Int -> Types t -> ShowS # show :: Types t -> String # showList :: [Types t] -> ShowS #

data ComputationTypes t Source #

Computation type S=>T reflects a type of term whose given value is of type S and result is of type T.

Constructors

Type (Types t)
ComputesType (Types t)	=>T
ComputesFromType (Types t) (Types t)	S=>T

Instances

Functor ComputationTypes Source #
Instance details Defined in Funcons.Operations.Values Methods fmap :: (a -> b) -> ComputationTypes a -> ComputationTypes b # (<$) :: a -> ComputationTypes b -> ComputationTypes a #
Eq t => Eq (ComputationTypes t) Source #
Instance details Defined in Funcons.Operations.Values Methods (==) :: ComputationTypes t -> ComputationTypes t -> Bool # (/=) :: ComputationTypes t -> ComputationTypes t -> Bool #
Ord t => Ord (ComputationTypes t) Source #
Instance details Defined in Funcons.Operations.Values Methods compare :: ComputationTypes t -> ComputationTypes t -> Ordering # (<) :: ComputationTypes t -> ComputationTypes t -> Bool # (<=) :: ComputationTypes t -> ComputationTypes t -> Bool # (>) :: ComputationTypes t -> ComputationTypes t -> Bool # (>=) :: ComputationTypes t -> ComputationTypes t -> Bool # max :: ComputationTypes t -> ComputationTypes t -> ComputationTypes t # min :: ComputationTypes t -> ComputationTypes t -> ComputationTypes t #
Read t => Read (ComputationTypes t) Source #
Instance details Defined in Funcons.Operations.Values Methods readsPrec :: Int -> ReadS (ComputationTypes t) # readList :: ReadS [ComputationTypes t] # readPrec :: ReadPrec (ComputationTypes t) # readListPrec :: ReadPrec [ComputationTypes t] #
Show t => Show (ComputationTypes t) Source #
Instance details Defined in Funcons.Operations.Values Methods showsPrec :: Int -> ComputationTypes t -> ShowS # show :: ComputationTypes t -> String # showList :: [ComputationTypes t] -> ShowS #

data SeqSortOp Source #

Postfix operators for specifying sequences.

Constructors

StarOp
PlusOp
QuestionMarkOp

Instances

Eq SeqSortOp Source #
Instance details Defined in Funcons.Operations.Values Methods (==) :: SeqSortOp -> SeqSortOp -> Bool # (/=) :: SeqSortOp -> SeqSortOp -> Bool #
Ord SeqSortOp Source #
Instance details Defined in Funcons.Operations.Values Methods compare :: SeqSortOp -> SeqSortOp -> Ordering # (<) :: SeqSortOp -> SeqSortOp -> Bool # (<=) :: SeqSortOp -> SeqSortOp -> Bool # (>) :: SeqSortOp -> SeqSortOp -> Bool # (>=) :: SeqSortOp -> SeqSortOp -> Bool # max :: SeqSortOp -> SeqSortOp -> SeqSortOp # min :: SeqSortOp -> SeqSortOp -> SeqSortOp #
Read SeqSortOp Source #
Instance details Defined in Funcons.Operations.Values Methods readsPrec :: Int -> ReadS SeqSortOp # readList :: ReadS [SeqSortOp] # readPrec :: ReadPrec SeqSortOp # readListPrec :: ReadPrec [SeqSortOp] #
Show SeqSortOp Source #
Instance details Defined in Funcons.Operations.Values Methods showsPrec :: Int -> SeqSortOp -> ShowS # show :: SeqSortOp -> String # showList :: [SeqSortOp] -> ShowS #

type ValueVectors t = Vector t Source #

type ValueSets t = Set t Source #

type ValueMaps t = Map t [t] Source #

data Values t Source #

This datatype provides a number of builtin value types. The type t is expected to be a super-type of `Values t`, such that there is a projection and injection between t and `Values t`, (see HasValues)

Constructors

ADTVal Name [t]
Atom String
ComputationType (ComputationTypes t)
Float Double
IEEE_Float_32 Float
IEEE_Float_64 Double
Int Integer
Map (ValueMaps (Values t))
Multiset (MultiSet (Values t))
Nat Integer
Rational Rational
Set (ValueSets (Values t))
Vector (ValueVectors (Values t))
VAny
ValSeq [t]

Instances

Eq t => Eq (Values t) Source #
Instance details Defined in Funcons.Operations.Values Methods (==) :: Values t -> Values t -> Bool # (/=) :: Values t -> Values t -> Bool #
Ord t => Ord (Values t) Source #
Instance details Defined in Funcons.Operations.Values Methods compare :: Values t -> Values t -> Ordering # (<) :: Values t -> Values t -> Bool # (<=) :: Values t -> Values t -> Bool # (>) :: Values t -> Values t -> Bool # (>=) :: Values t -> Values t -> Bool # max :: Values t -> Values t -> Values t # min :: Values t -> Values t -> Values t #
(Read t, Ord t) => Read (Values t) Source #
Instance details Defined in Funcons.Operations.Values Methods readsPrec :: Int -> ReadS (Values t) # readList :: ReadS [Values t] # readPrec :: ReadPrec (Values t) # readListPrec :: ReadPrec [Values t] #
Show t => Show (Values t) Source #
Instance details Defined in Funcons.Operations.Values Methods showsPrec :: Int -> Values t -> ShowS # show :: Values t -> String # showList :: [Values t] -> ShowS #
HasValues t => IsString (Values t) Source #
Instance details Defined in Funcons.Operations.Values Methods fromString :: String -> Values t #

type MVar = String Source #

type Name = Text Source #

ascii_cons :: [Char] Source #

unicode_cons :: Name Source #

tuple :: HasValues t => [Values t] -> Values t Source #

list :: HasValues t => [Values t] -> Values t Source #

vector :: HasValues t => [Values t] -> Values t Source #

multi :: HasValues t => [t] -> Values t Source #

multi_ :: HasValues t => [Values t] -> Values t Source #

sets :: HasValues t => Types t -> Types t Source #

multisets :: HasValues t => Types t -> Types t Source #

maps :: HasValues t => t -> t -> Types t Source #

vectors :: HasValues t => Types t -> Types t Source #

vmap :: Ord b => (a -> b) -> Values a -> Values b Source #

traverseV :: (Ord b, Monad m, HasValues a, HasValues b) => (a -> m b) -> Values a -> m (Values b) Source #

traverseVM :: (Ord b, Monad m, HasValues a, HasValues b) => (a -> m b) -> ([a] -> m [b]) -> Values a -> m (Values b) Source #

traverseT :: (Ord b, Monad m, HasValues a, HasValues b) => (a -> m b) -> Types a -> m (Types b) Source #

traverseTM :: (Ord b, Monad m, HasValues a, HasValues b) => (a -> m b) -> ([a] -> m [b]) -> Types a -> m (Types b) Source #

traverseCTM :: (Ord b, Monad m, HasValues a, HasValues b) => (a -> m b) -> ([a] -> m [b]) -> ComputationTypes a -> m (ComputationTypes b) Source #

structVcompare :: (Monoid m, HasValues a, HasValues b) => (a -> b -> Maybe m) -> Values a -> Values b -> Maybe (Maybe m) Source #

structCTMcompare :: (Monoid m, HasValues a, HasValues b) => (a -> b -> Maybe m) -> ([a] -> [b] -> Maybe m) -> ComputationTypes a -> ComputationTypes b -> Maybe (Maybe m) Source #

structVMcompare :: (Monoid m, HasValues b, HasValues a) => (a -> b -> Maybe m) -> ([a] -> [b] -> Maybe m) -> Values a -> Values b -> Maybe (Maybe m) Source #

structTMcompare :: (Monoid m, HasValues a, HasValues b) => (a -> b -> Maybe m) -> ([a] -> [b] -> Maybe m) -> Types a -> Types b -> Maybe (Maybe m) Source #

downcastValueType :: Values t -> Types t Source #

upcastRationals :: Values t -> Values t Source #

Returns the rational representation of a value if it is a subtype. Otherwise it returns the original value.

upcastIntegers :: Values t -> Values t Source #

Returns the integer representation of a value if it is a subtype. Otherwise it returns the original value.

upcastNaturals :: Values t -> Values t Source #

Returns the natural representation of a value if it is a subtype. Otherwise it returns the original value.

upcastCharacter :: HasValues t => Values t -> Maybe Char Source #

castType :: HasValues t => Values t -> Maybe (Types t) Source #

mk_integers :: Integer -> Values t Source #

mk_naturals :: Integer -> Values t Source #

mk_unicode_characters :: HasValues t => Char -> Values t Source #

downcast_unicode_characters :: HasValues t => Char -> Values t Source #

Checks whetDoes not check whether the `unicode-point` of

(===) :: (HasValues t, Eq t) => Values t -> Values t -> Bool Source #

(=/=) :: (HasValues t, Eq t) => Values t -> Values t -> Bool Source #

isGround :: HasValues t => Values t -> Bool Source #

isNat :: Values t -> Bool Source #

isInt :: Values t -> Bool Source #

isEnv :: Values t -> Bool Source #

isMap :: Values t -> Bool Source #

isSet :: Values t -> Bool Source #

isString_ :: HasValues t => Values t -> Bool Source #

isType :: Values t -> Bool Source #

isVec :: Values t -> Bool Source #

unString :: HasValues t => Values t -> String Source #

null__ :: Values t Source #

null_value__ :: Values t Source #

isNull :: Values t -> Bool Source #

isDefinedVal :: Values t -> Bool Source #

ppValues :: HasValues t => (t -> String) -> Values t -> String Source #

ppComputationTypes :: HasValues t => (t -> String) -> ComputationTypes t -> String Source #

ppTypes :: HasValues t => (t -> String) -> Types t -> String Source #

ppOp :: SeqSortOp -> String Source #

showArgs_ :: [String] -> String Source #

data EvalResult t Source #

Constructors

Error (OpExpr t) (Result t)
Success t

Instances

(HasValues t, Show t) => Show (EvalResult t) Source #
Instance details Defined in Funcons.Operations.Eval Methods showsPrec :: Int -> EvalResult t -> ShowS # show :: EvalResult t -> String # showList :: [EvalResult t] -> ShowS #

eval :: HasValues t => OpExpr t -> EvalResult t Source #

applyEval :: OpExpr t -> Result t -> EvalResult t Source #

lists_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

lists :: HasValues t => OpExpr t -> OpExpr t Source #

list_singleton_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

list_singleton :: HasValues t => OpExpr t -> OpExpr t Source #

nil_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

nil :: HasValues t => OpExpr t Source #

is_nil_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_nil :: HasValues t => OpExpr t -> OpExpr t Source #

cons_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

cons :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

list_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

list_append_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

list_append :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

isList :: HasValues t => Values t -> Bool Source #

toList :: HasValues t => Values t -> [Values t] Source #

list_concat_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

list_concat :: HasValues t => [OpExpr t] -> OpExpr t Source #

head_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tail_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

headOp :: HasValues t => OpExpr t -> OpExpr t Source #

tailOp :: HasValues t => OpExpr t -> OpExpr t Source #

tuples_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tuple_is_empty_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tuple_is_empty :: HasValues t => OpExpr t -> OpExpr t Source #

empty_tuple_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tuple_prepend_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

empty_tuple :: HasValues t => OpExpr t Source #

tuple_prepend :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

tuple_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tuple_index_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tuple_index :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

tuple_head_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tuple_tail_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

tupleHeadOp :: HasValues t => OpExpr t -> OpExpr t Source #

tupleTailOp :: HasValues t => OpExpr t -> OpExpr t Source #

tobool :: Bool -> Values t Source #

frombool :: Values t -> Maybe Bool Source #

booleans_ :: HasValues t => OpExpr t Source #

true_ :: HasValues t => Values t Source #

false_ :: HasValues t => Values t Source #

is_equal_ :: (HasValues t, Eq t) => [OpExpr t] -> OpExpr t Source #

is_equal :: (HasValues t, Eq t) => OpExpr t -> OpExpr t -> OpExpr t Source #

toOpt :: HasValues t => Maybe t -> Values t Source #

none__ :: Values t Source #

optionals_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

optionals :: HasValues t => OpExpr t -> OpExpr t Source #

some__ :: HasValues t => t -> Values t Source #

some_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

some :: HasValues t => OpExpr t -> OpExpr t Source #

none_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

none :: HasValues t => OpExpr t Source #

datatype_values_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

datatype_values :: HasValues t => OpExpr t Source #

ground_values_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

ground_values :: HasValues t => OpExpr t Source #

types_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

types :: HasValues t => OpExpr t Source #

value_types_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

value_types :: HasValues t => OpExpr t Source #

empty_type_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

empty_type :: HasValues t => OpExpr t Source #

nulltype_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

nulltype :: HasValues t => OpExpr t Source #

null_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

null :: HasValues t => OpExpr t Source #

values_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

values :: HasValues t => OpExpr t Source #

is_value_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_value :: HasValues t => OpExpr t -> OpExpr t Source #

value_type_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

value_type :: HasValues t => OpExpr t -> OpExpr t Source #

tyOf :: HasValues t => Values t -> Types t Source #

type_member_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

type_member :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

Type membership check for primitive types and predefined composite types (non-ADTs).

isInType :: HasValues t => Values t -> Types t -> Maybe Bool Source #

isInTupleType :: HasValues t => [Values t] -> [Types t] -> Maybe Bool Source #

non_grounded_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

non_grounded :: HasValues t => OpExpr t -> OpExpr t Source #

non_grounded_values_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

non_grounded_values :: HasValues t => OpExpr t Source #

integer_mod_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_modulo_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

stepMod :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

integers_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integers :: HasValues t => OpExpr t Source #

integers_from_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integers_from :: HasValues t => OpExpr t -> OpExpr t Source #

integers_up_to_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integers_up_to :: HasValues t => OpExpr t -> OpExpr t Source #

is_integer_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_integer :: HasValues t => OpExpr t -> OpExpr t Source #

integer_add_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_multiply_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_subtract_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_subtract :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

integer_divide_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_divide :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

integer_power_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_power :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

natural_predecessor_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

nat_pred_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

natural_predecessor :: HasValues t => OpExpr t -> OpExpr t Source #

natural_successor_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

nat_succ_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

natural_successor :: HasValues t => OpExpr t -> OpExpr t Source #

integer_list_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_list :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

integer_absolute_value_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

integer_absolute_value :: HasValues t => OpExpr t -> OpExpr t Source #

decimal_natural_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

decimal_natural :: HasValues t => OpExpr t -> OpExpr t Source #

binary_natural_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

binary_natural :: HasValues t => OpExpr t -> OpExpr t Source #

octal_natural_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

octal_natural :: HasValues t => OpExpr t -> OpExpr t Source #

hexadecimal_natural_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

hexadecimal_natural :: HasValues t => OpExpr t -> OpExpr t Source #

is_less_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_less :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

is_less_or_equal_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_less_or_equal :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

is_greater_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_greater :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

is_greater_or_equal_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_greater_or_equal :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

ieee_float_truncate_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

ieee_float_truncate :: HasValues t => OpExpr t -> OpExpr t -> OpExpr t Source #

ieee_float_add_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

ieee_float_op :: HasValues t => String -> (Double -> Double -> Double) -> Double -> Values t -> [Values t] -> Result t Source #

isIEEEFormat :: Values t -> Values t -> Bool Source #

doubleFromIEEEFormat :: Values t -> Values t -> Double Source #

is_string_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

is_string :: HasValues t => OpExpr t -> OpExpr t Source #

to_string_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

to_string :: HasValues t => OpExpr t -> OpExpr t Source #

stepTo_String :: HasValues t => Values t -> Result t Source #

mk_string :: HasValues t => String -> Result t Source #

type Graph e = Map e (Set e) Source #

is_cyclic_ :: (Ord t, HasValues t) => [OpExpr t] -> OpExpr t Source #

is_cyclic :: (Ord t, HasValues t) => OpExpr t -> OpExpr t Source #

topological_sort_ :: (Ord t, HasValues t) => [OpExpr t] -> OpExpr t Source #

topological_sort :: (Ord t, HasValues t) => OpExpr t -> OpExpr t Source #

toGraph :: Ord t => Values t -> Maybe (Graph (Values t)) Source #

entries :: Eq e => Graph e -> [e] Source #

Get the entry points of the graph

delete :: Ord e => e -> Graph e -> Graph e Source #

Delete a node from the graph

schedule :: Ord e => Graph e -> ([e], Graph e) Source #

Return all nodes in the graph such that if `a -> b` in the graph then a occurs before b in the result Also returns a graph which, if cyclic, contains all the cycles in the original graph, corresponding to nodes not in the schedule.

cyclic :: Ord e => Graph e -> Bool Source #

Checks whether the given grammar contains cycles

is_empty :: Map k a -> Bool Source #

Checks whether the given graph is empty

sets_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

set_empty_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

set_empty :: HasValues t => OpExpr t Source #

is_in_set_ :: (HasValues t, Ord t) => [OpExpr t] -> OpExpr t Source #

is_in_set :: (HasValues t, Ord t) => OpExpr t -> OpExpr t -> OpExpr t Source #

set_elements_ :: HasValues t => [OpExpr t] -> OpExpr t Source #

set_elements :: HasValues t => OpExpr t -> OpExpr t Source #

set_size_ :: (Ord t, HasValues t) => [OpExpr t] -> OpExpr t Source #