Safe Haskell	None
Language	Haskell2010

Curly.Core.Annotated

Contents

Building blocks
Annotated expressions
Named expressions
- Useful pre-defined expressions
Expression post-processing

Synopsis

Documentation

module Curly.Core.Types

Building blocks

data Symbol s Source #

A symbol is either an argument referring to its nth parent, or a builtin

Constructors

Argument Int
Builtin (Type s) Builtin

Instances

(Identifier s, Identifier s') => HasIdents s s' (Symbol s) (Symbol s') Source #
Methods ff'idents :: FixFold s s' (Symbol s) (Symbol s') Source #
(Serializable Bytes s, Identifier s) => Serializable Bytes (Symbol s) Source #
Methods encode :: Proxy Bytes -> Symbol s -> StreamBuilder Bytes #
(Format Bytes s, Identifier s) => Format Bytes (Symbol s) Source #
Methods datum :: Parser Bytes (Symbol s) #
Eq (Symbol s) Source #
Methods (==) :: Symbol s -> Symbol s -> Bool # (/=) :: Symbol s -> Symbol s -> Bool #
Ord (Symbol s) Source #
Methods compare :: Symbol s -> Symbol s -> Ordering # (<) :: Symbol s -> Symbol s -> Bool # (<=) :: Symbol s -> Symbol s -> Bool # (>) :: Symbol s -> Symbol s -> Bool # (>=) :: Symbol s -> Symbol s -> Bool # max :: Symbol s -> Symbol s -> Symbol s # min :: Symbol s -> Symbol s -> Symbol s #
Show (Symbol s) Source #
Methods showsPrec :: Int -> Symbol s -> ShowS # show :: Symbol s -> String # showList :: [Symbol s] -> ShowS #
Generic (Symbol s) Source #
Associated Types type Rep (Symbol s) :: * -> * # Methods from :: Symbol s -> Rep (Symbol s) x # to :: Rep (Symbol s) x -> Symbol s #
NFData (Symbol s) Source #
Methods rnf :: Symbol s -> () #
Documented (Symbol s) Source #
Methods document :: Symbol s -> Documentation Source #
Identifier s => Annotated (NameExpr s) s Source #
Methods exprIdent :: NameExpr s -> Int Source # exprMass :: NameExpr s -> Int Source # exprRefs :: NameExpr s -> Map (Symbol s) Int Source # exprType :: NameExpr s -> Type s Source # exprStrictness :: NameExpr s -> ExprStrictness s Source #
Identifier s => Annotated (AnnExpr s) s Source #
Methods exprIdent :: AnnExpr s -> Int Source # exprMass :: AnnExpr s -> Int Source # exprRefs :: AnnExpr s -> Map (Symbol s) Int Source # exprType :: AnnExpr s -> Type s Source # exprStrictness :: AnnExpr s -> ExprStrictness s Source #
Identifier s => Semantic (AnnExpr s) s (Symbol s) Source #
Methods semNode :: Iso' (AnnExpr s) (SemanticT (AnnExpr s) s (Symbol s)) Source #
Identifier s => Semantic (RawNameExpr s) s (s, NameTail s) Source #
Methods semNode :: Iso' (RawNameExpr s) (SemanticT (RawNameExpr s) s (s, NameTail s)) Source #
Identifier s => Semantic (NameExpr s) s (s, NameTail s) Source #
Methods semNode :: Iso' (NameExpr s) (SemanticT (NameExpr s) s (s, NameTail s)) Source #
type Rep (Symbol s) Source #
type Rep (Symbol s) = D1 (MetaData "Symbol" "Curly.Core.Annotated" "curly-core-0.7.2-5Alk9IYXOqrI6xJCLJNJpU" False) ((:+:) (C1 (MetaCons "Argument" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int))) (C1 (MetaCons "Builtin" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Type s))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Builtin)))))

t'Argument :: Traversal' (Symbol s) Int Source #

t'Builtin :: Traversal (Type s, Builtin) (Type s', Builtin) (Symbol s) (Symbol s') Source #

data AnnNode s a Source #

An annotated node

This type is used as a base for all fully-resolved expressions. It helps in caching most of the intermediate steps of compiling, such as knowing which variables are free, what size it is, or its type.

Constructors

AnnNode
Fields _ident, _mass :: Int _refs :: Map (Symbol s) Int _type :: Type s _strictness :: ExprStrictness s _shape :: ExprNode s a

Instances

(Identifier s, Identifier s') => HasIdents s s' (AnnNode s a) (AnnNode s' a) Source #
Methods ff'idents :: FixFold s s' (AnnNode s a) (AnnNode s' a) Source #
Functor (AnnNode s) Source #
Methods map :: (a -> b) -> AnnNode s a -> AnnNode s b #
Foldable (AnnNode s) Source #
Methods fold :: Monoid m => AnnNode s m -> m #
Traversable (AnnNode s) Source #
Methods sequence :: Applicative f => AnnNode s (f a) -> f (AnnNode s a) #
Identifier s => Annotated (AnnExpr s) s Source #
Methods exprIdent :: AnnExpr s -> Int Source # exprMass :: AnnExpr s -> Int Source # exprRefs :: AnnExpr s -> Map (Symbol s) Int Source # exprType :: AnnExpr s -> Type s Source # exprStrictness :: AnnExpr s -> ExprStrictness s Source #
Identifier s => Semantic (AnnExpr s) s (Symbol s) Source #
Methods semNode :: Iso' (AnnExpr s) (SemanticT (AnnExpr s) s (Symbol s)) Source #
Eq (AnnNode s a) Source #
Methods (==) :: AnnNode s a -> AnnNode s a -> Bool # (/=) :: AnnNode s a -> AnnNode s a -> Bool #
Ord (AnnNode s a) Source #
Methods compare :: AnnNode s a -> AnnNode s a -> Ordering # (<) :: AnnNode s a -> AnnNode s a -> Bool # (<=) :: AnnNode s a -> AnnNode s a -> Bool # (>) :: AnnNode s a -> AnnNode s a -> Bool # (>=) :: AnnNode s a -> AnnNode s a -> Bool # max :: AnnNode s a -> AnnNode s a -> AnnNode s a # min :: AnnNode s a -> AnnNode s a -> AnnNode s a #
Generic (AnnNode s a) Source #
Associated Types type Rep (AnnNode s a) :: * -> * # Methods from :: AnnNode s a -> Rep (AnnNode s a) x # to :: Rep (AnnNode s a) x -> AnnNode s a #
(NFData s, NFData a) => NFData (AnnNode s a) Source #
Methods rnf :: AnnNode s a -> () #
type Rep (AnnNode s a) Source #
type Rep (AnnNode s a) = D1 (MetaData "AnnNode" "Curly.Core.Annotated" "curly-core-0.7.2-5Alk9IYXOqrI6xJCLJNJpU" False) (C1 (MetaCons "AnnNode" PrefixI True) ((::) ((::) (S1 (MetaSel (Just Symbol "_ident") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) ((::) (S1 (MetaSel (Just Symbol "_mass") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Just Symbol "_refs") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Map (Symbol s) Int))))) ((::) (S1 (MetaSel (Just Symbol "_type") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Type s))) ((:*:) (S1 (MetaSel (Just Symbol "_strictness") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (ExprStrictness s))) (S1 (MetaSel (Just Symbol "_shape") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (ExprNode s a)))))))

data Strictness s Source #

Instances

HasIdents s s' (Strictness s) (Strictness s') Source #
Methods ff'idents :: FixFold s s' (Strictness s) (Strictness s') Source #
Serializable Bytes s => Serializable Bytes (Strictness s) Source #
Methods encode :: Proxy Bytes -> Strictness s -> StreamBuilder Bytes #
Format Bytes s => Format Bytes (Strictness s) Source #
Methods datum :: Parser Bytes (Strictness s) #
Eq s => Eq (Strictness s) Source #
Methods (==) :: Strictness s -> Strictness s -> Bool # (/=) :: Strictness s -> Strictness s -> Bool #
Ord s => Ord (Strictness s) Source #
Methods compare :: Strictness s -> Strictness s -> Ordering # (<) :: Strictness s -> Strictness s -> Bool # (<=) :: Strictness s -> Strictness s -> Bool # (>) :: Strictness s -> Strictness s -> Bool # (>=) :: Strictness s -> Strictness s -> Bool # max :: Strictness s -> Strictness s -> Strictness s # min :: Strictness s -> Strictness s -> Strictness s #
Generic (Strictness s) Source #
Associated Types type Rep (Strictness s) :: * -> * # Methods from :: Strictness s -> Rep (Strictness s) x # to :: Rep (Strictness s) x -> Strictness s #
NFData s => NFData (Strictness s) Source #
Methods rnf :: Strictness s -> () #
Identifier s => Documented (Strictness s) Source #
Methods document :: Strictness s -> Documentation Source #
type Rep (Strictness s) Source #
type Rep (Strictness s)

type ExprStrictness s = ([Strictness s], Strictness s) Source #

noStrictness :: Strictness s Source #

Annotated expressions

class Identifier s => Annotated e s | e -> s where Source #

The class of annotated expressions, from which some information may be retrieved.

Minimal complete definition

exprIdent, exprMass, exprRefs, exprType, exprStrictness

Methods

exprIdent :: e -> Int Source #

exprMass :: e -> Int Source #

exprRefs :: e -> Map (Symbol s) Int Source #

exprType :: e -> Type s Source #

exprStrictness :: e -> ExprStrictness s Source #

Instances

Identifier s => Annotated (NameExpr s) s Source #
Methods exprIdent :: NameExpr s -> Int Source # exprMass :: NameExpr s -> Int Source # exprRefs :: NameExpr s -> Map (Symbol s) Int Source # exprType :: NameExpr s -> Type s Source # exprStrictness :: NameExpr s -> ExprStrictness s Source #
Identifier s => Annotated (AnnExpr s) s Source #
Methods exprIdent :: AnnExpr s -> Int Source # exprMass :: AnnExpr s -> Int Source # exprRefs :: AnnExpr s -> Map (Symbol s) Int Source # exprType :: AnnExpr s -> Type s Source # exprStrictness :: AnnExpr s -> ExprStrictness s Source #

annType :: Lens' (AnnNode s a) (Type s) Source #

type AnnExpr s = Free (AnnNode s) (Symbol s) Source #

A fully-resolved, annotated expression

anonymous :: NameExpr s -> AnnExpr s Source #

Remove all naming information from an expression.

Named expressions

data NameNode s a Source #

A partially-resolved expression node

Instances

(Identifier s, Identifier s') => HasIdents s s' (NameNode s a) (NameNode s' a) Source #
Methods ff'idents :: FixFold s s' (NameNode s a) (NameNode s' a) Source #
Functor (NameNode s) Source #
Methods map :: (a -> b) -> NameNode s a -> NameNode s b #
Foldable (NameNode s) Source #
Methods fold :: Monoid m => NameNode s m -> m #
Traversable (NameNode s) Source #
Methods sequence :: Applicative f => NameNode s (f a) -> f (NameNode s a) #
Identifier s => Annotated (NameExpr s) s Source #
Methods exprIdent :: NameExpr s -> Int Source # exprMass :: NameExpr s -> Int Source # exprRefs :: NameExpr s -> Map (Symbol s) Int Source # exprType :: NameExpr s -> Type s Source # exprStrictness :: NameExpr s -> ExprStrictness s Source #
Identifier s => Semantic (RawNameExpr s) s (s, NameTail s) Source #
Methods semNode :: Iso' (RawNameExpr s) (SemanticT (RawNameExpr s) s (s, NameTail s)) Source #
Identifier s => Semantic (NameExpr s) s (s, NameTail s) Source #
Methods semNode :: Iso' (NameExpr s) (SemanticT (NameExpr s) s (s, NameTail s)) Source #
(Eq a, Eq s) => Eq (NameNode s a) Source #
Methods (==) :: NameNode s a -> NameNode s a -> Bool # (/=) :: NameNode s a -> NameNode s a -> Bool #
(Ord a, Ord s) => Ord (NameNode s a) Source #
Methods compare :: NameNode s a -> NameNode s a -> Ordering # (<) :: NameNode s a -> NameNode s a -> Bool # (<=) :: NameNode s a -> NameNode s a -> Bool # (>) :: NameNode s a -> NameNode s a -> Bool # (>=) :: NameNode s a -> NameNode s a -> Bool # max :: NameNode s a -> NameNode s a -> NameNode s a # min :: NameNode s a -> NameNode s a -> NameNode s a #

type NameExpr s = NameNode s (NameTail s) Source #

A partially resolved expression. Each level corresponds to a different module.

newtype RawNameExpr s Source #

Constructors

RawNameExpr
Fields _rawNameExpr :: NameExpr s

Instances

Identifier s => Semantic (RawNameExpr s) s (s, NameTail s) Source #
Methods semNode :: Iso' (RawNameExpr s) (SemanticT (RawNameExpr s) s (s, NameTail s)) Source #

type NameTail s = Free (NameNode s) (Symbol s) Source #

i'NameNode :: Iso (NameNode s a) (NameNode t b) (Free (AnnNode s) (s, a)) (Free (AnnNode t) (t, b)) Source #

A NameNode's representation

t'exprType :: Fold' (NameExpr s) (Type s) Source #

Useful pre-defined expressions

expr_identity :: Identifier s => RawNameExpr s Source #

expr_constant :: Identifier s => RawNameExpr s -> RawNameExpr s Source #

expr_constructor :: Identifier s => Type s -> RawNameExpr s Source #

expr_destructor :: Identifier s => Type s -> RawNameExpr s Source #

Expression post-processing

optimize :: forall s. Identifier s => (Builtin -> s) -> NameExpr s -> NameExpr s Source #

solveConstraints :: Identifier s => InstanceMap s (Type s, NameExpr s) -> NameExpr s -> NameExpr s Source #