Copyright	disco team and contributors
Maintainer	byorgey@gmail.com
Safe Haskell	Safe-Inferred
Language	Haskell2010

Disco.Syntax.Prims

Description

Concrete syntax for the prims (i.e. built-in constants) supported by the language.

Synopsis

data Prim where
- PrimUOp :: UOp -> Prim
- PrimBOp :: BOp -> Prim
- PrimLeft :: Prim
- PrimRight :: Prim
- PrimSqrt :: Prim
- PrimFloor :: Prim
- PrimCeil :: Prim
- PrimAbs :: Prim
- PrimPower :: Prim
- PrimList :: Prim
- PrimBag :: Prim
- PrimSet :: Prim
- PrimB2C :: Prim
- PrimC2B :: Prim
- PrimUC2B :: Prim
- PrimMapToSet :: Prim
- PrimSetToMap :: Prim
- PrimSummary :: Prim
- PrimVertex :: Prim
- PrimEmptyGraph :: Prim
- PrimOverlay :: Prim
- PrimConnect :: Prim
- PrimInsert :: Prim
- PrimLookup :: Prim
- PrimEach :: Prim
- PrimReduce :: Prim
- PrimFilter :: Prim
- PrimJoin :: Prim
- PrimMerge :: Prim
- PrimIsPrime :: Prim
- PrimFactor :: Prim
- PrimFrac :: Prim
- PrimCrash :: Prim
- PrimUntil :: Prim
- PrimHolds :: Prim
- PrimLookupSeq :: Prim
- PrimExtendSeq :: Prim
data PrimInfo = PrimInfo {
- thePrim :: Prim
- primSyntax :: String
- primExposed :: Bool
}
primTable :: [PrimInfo]
toPrim :: String -> [Prim]
primMap :: Map Prim PrimInfo

Documentation

data Prim where Source #

Primitives, i.e. built-in constants.

Constructors

PrimUOp
Fields :: UOp -> Prim Unary operator
PrimBOp
Fields :: BOp -> Prim Binary operator
PrimLeft
Fields :: Prim Left injection into a sum type.
PrimRight
Fields :: Prim Right injection into a sum type.
PrimSqrt
Fields :: Prim Integer square root (`sqrt`)
PrimFloor
Fields :: Prim Floor of fractional type (`floor`)
PrimCeil
Fields :: Prim Ceiling of fractional type (`ceiling`)
PrimAbs
Fields :: Prim Absolute value (`abs`)
PrimPower
Fields :: Prim Power set (XXX or bag?)
PrimList
Fields :: Prim Container -> list conversion
PrimBag
Fields :: Prim Container -> bag conversion
PrimSet
Fields :: Prim Container -> set conversion
PrimB2C
Fields :: Prim bag -> set of counts conversion
PrimC2B
Fields :: Prim set of counts -> bag conversion
PrimUC2B
Fields :: Prim unsafe set of counts -> bag conversion that assumes all distinct
PrimMapToSet
Fields :: Prim Map k v -> Set (k × v)
PrimSetToMap
Fields :: Prim Set (k × v) -> Map k v
PrimSummary
Fields :: Prim Get Adjacency list of Graph
PrimVertex
Fields :: Prim Construct a graph Vertex
PrimEmptyGraph
Fields :: Prim Empty graph
PrimOverlay
Fields :: Prim Overlay two Graphs
PrimConnect
Fields :: Prim Connect Graph to another with directed edges
PrimInsert
Fields :: Prim Insert into map
PrimLookup
Fields :: Prim Get value associated with key in map
PrimEach
Fields :: Prim Each operation for containers
PrimReduce
Fields :: Prim Reduce operation for containers
PrimFilter
Fields :: Prim Filter operation for containers
PrimJoin
Fields :: Prim Monadic join for containers
PrimMerge
Fields :: Prim Generic merge operation for bags/sets
PrimIsPrime
Fields :: Prim Efficient primality test
PrimFactor
Fields :: Prim Factorization
PrimFrac
Fields :: Prim Turn a rational into a pair (num, denom)
PrimCrash
Fields :: Prim Crash
PrimUntil
Fields :: Prim [x, y, z .. e]
PrimHolds
Fields :: Prim Test whether a proposition holds
PrimLookupSeq
Fields :: Prim Lookup OEIS sequence
PrimExtendSeq
Fields :: Prim Extend OEIS sequence

Instances

Instances details

Data Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Prim -> c Prim # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Prim # toConstr :: Prim -> Constr # dataTypeOf :: Prim -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Prim) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Prim) # gmapT :: (forall b. Data b => b -> b) -> Prim -> Prim # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Prim -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Prim -> r # gmapQ :: (forall d. Data d => d -> u) -> Prim -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Prim -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Prim -> m Prim # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Prim -> m Prim # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Prim -> m Prim #
Generic Prim Source #
Instance details Defined in Disco.Syntax.Prims Associated Types type Rep Prim :: Type -> Type # Methods from :: Prim -> Rep Prim x # to :: Rep Prim x -> Prim #
Read Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods readsPrec :: Int -> ReadS Prim # readList :: ReadS [Prim] # readPrec :: ReadPrec Prim # readListPrec :: ReadPrec [Prim] #
Show Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods showsPrec :: Int -> Prim -> ShowS # show :: Prim -> String # showList :: [Prim] -> ShowS #
Eq Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods (==) :: Prim -> Prim -> Bool # (/=) :: Prim -> Prim -> Bool #
Ord Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods compare :: Prim -> Prim -> Ordering # (<) :: Prim -> Prim -> Bool # (<=) :: Prim -> Prim -> Bool # (>) :: Prim -> Prim -> Bool # (>=) :: Prim -> Prim -> Bool # max :: Prim -> Prim -> Prim # min :: Prim -> Prim -> Prim #
Alpha Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods aeq' :: AlphaCtx -> Prim -> Prim -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> Prim -> f Prim # close :: AlphaCtx -> NamePatFind -> Prim -> Prim # open :: AlphaCtx -> NthPatFind -> Prim -> Prim # isPat :: Prim -> DisjointSet AnyName # isTerm :: Prim -> All # isEmbed :: Prim -> Bool # nthPatFind :: Prim -> NthPatFind # namePatFind :: Prim -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> Prim -> Prim # lfreshen' :: LFresh m => AlphaCtx -> Prim -> (Prim -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> Prim -> m (Prim, Perm AnyName) # acompare' :: AlphaCtx -> Prim -> Prim -> Ordering #
Subst t Prim Source #
Instance details Defined in Disco.Syntax.Prims Methods isvar :: Prim -> Maybe (SubstName Prim t) # isCoerceVar :: Prim -> Maybe (SubstCoerce Prim t) # subst :: Name t -> t -> Prim -> Prim # substs :: [(Name t, t)] -> Prim -> Prim #
type Rep Prim Source #
Instance details Defined in Disco.Syntax.Prims type Rep Prim = D1 ('MetaData "Prim" "Disco.Syntax.Prims" "disco-0.1.6-4H4WbJGKK2PJTBCPs5wYLr" 'False) (((((C1 ('MetaCons "PrimUOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UOp)) :+: C1 ('MetaCons "PrimBOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BOp))) :+: (C1 ('MetaCons "PrimLeft" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimRight" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "PrimSqrt" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimFloor" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimCeil" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PrimAbs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimPower" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "PrimList" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimBag" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimSet" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimB2C" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "PrimC2B" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimUC2B" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimMapToSet" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PrimSetToMap" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimSummary" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: ((((C1 ('MetaCons "PrimVertex" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimEmptyGraph" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimOverlay" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimConnect" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "PrimInsert" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimLookup" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimEach" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PrimReduce" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimFilter" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "PrimJoin" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimMerge" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimIsPrime" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PrimFactor" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimFrac" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "PrimCrash" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimUntil" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PrimHolds" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PrimLookupSeq" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PrimExtendSeq" 'PrefixI 'False) (U1 :: Type -> Type)))))))

data PrimInfo Source #

An info record for a single primitive name, containing the primitive itself, its concrete syntax, and whether it is "exposed", i.e. available to be used in the surface syntax of the basic language. Unexposed prims can only be referenced by enabling the Primitives language extension and prefixing their name by $.

Constructors

PrimInfo
Fields thePrim :: Prim primSyntax :: String primExposed :: Bool

primTable :: [PrimInfo] Source #

A table containing a PrimInfo record for every non-operator Prim recognized by the language.

toPrim :: String -> [Prim] Source #

Find any exposed prims with the given name.

primMap :: Map Prim PrimInfo Source #

A convenient map from each Prim to its info record.