Safe Haskell	None
Language	Haskell2010

Agda.TypeChecking.SizedTypes.Syntax

Contents

Syntax
Polarities to specify solutions.
Solutions.
Constraint simplification
Printing
Wellformedness
Computing variable sets

Description

Syntax of size expressions and constraints.

Synopsis

newtype Offset = O Int
newtype Rigid = RigidId {
- rigidId :: String
}
newtype Flex = FlexId {
- flexId :: String
}
data SizeExpr' rigid flex
- = Const {
  - offset :: Offset
  }
- | Rigid {
  - rigid :: rigid
  - offset :: Offset
  }
- | Infty
- | Flex {
  - flex :: flex
  - offset :: Offset
  }
type SizeExpr = SizeExpr' Rigid Flex
data Cmp
- = Lt
- | Le
data Constraint' rigid flex = Constraint {
- leftExpr :: SizeExpr' rigid flex
- cmp :: Cmp
- rightExpr :: SizeExpr' rigid flex
}
type Constraint = Constraint' Rigid Flex
data Polarity
- = Least
- | Greatest
data PolarityAssignment flex = PolarityAssignment Polarity flex
type Polarities flex = Map flex Polarity
emptyPolarities :: Polarities flex
polaritiesFromAssignments :: Ord flex => [PolarityAssignment flex] -> Polarities flex
getPolarity :: Ord flex => Polarities flex -> flex -> Polarity
newtype Solution rigid flex = Solution {
- theSolution :: Map flex (SizeExpr' rigid flex)
}
emptySolution :: Solution r f
class Substitute r f a where
type CTrans r f = Constraint' r f -> Either String [Constraint' r f]
simplify1 :: (Pretty f, Pretty r, Eq r) => CTrans r f -> CTrans r f
ifLe :: Cmp -> a -> a -> a
compareOffset :: Offset -> Cmp -> Offset -> Bool
class ValidOffset a where
class TruncateOffset a where
class Rigids r a where
class Flexs flex a | a -> flex where

Syntax

newtype Offset #

Constant finite sizes n >= 0.

Constructors

O Int

Instances

Enum Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods succ :: Offset -> Offset # pred :: Offset -> Offset # toEnum :: Int -> Offset # fromEnum :: Offset -> Int # enumFrom :: Offset -> [Offset] # enumFromThen :: Offset -> Offset -> [Offset] # enumFromTo :: Offset -> Offset -> [Offset] # enumFromThenTo :: Offset -> Offset -> Offset -> [Offset] #
Eq Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (==) :: Offset -> Offset -> Bool # (/=) :: Offset -> Offset -> Bool #
Num Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (+) :: Offset -> Offset -> Offset # (-) :: Offset -> Offset -> Offset # (*) :: Offset -> Offset -> Offset # negate :: Offset -> Offset # abs :: Offset -> Offset # signum :: Offset -> Offset # fromInteger :: Integer -> Offset #
Ord Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compare :: Offset -> Offset -> Ordering # (<) :: Offset -> Offset -> Bool # (<=) :: Offset -> Offset -> Bool # (>) :: Offset -> Offset -> Bool # (>=) :: Offset -> Offset -> Bool # max :: Offset -> Offset -> Offset # min :: Offset -> Offset -> Offset #
Show Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> Offset -> ShowS # show :: Offset -> String # showList :: [Offset] -> ShowS #
MeetSemiLattice Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods meet :: Offset -> Offset -> Offset #
Pretty Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Offset -> Doc # prettyPrec :: Int -> Offset -> Doc # prettyList :: [Offset] -> Doc #
TruncateOffset Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods truncateOffset :: Offset -> Offset #
ValidOffset Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods validOffset :: Offset -> Bool #
Negative Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.WarshallSolver Methods negative :: Offset -> Bool #
Plus Offset Offset Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods plus :: Offset -> Offset -> Offset #
Plus Offset Weight Weight #
Instance details Defined in Agda.TypeChecking.SizedTypes.WarshallSolver Methods plus :: Offset -> Weight -> Weight #
Plus Weight Offset Weight #
Instance details Defined in Agda.TypeChecking.SizedTypes.WarshallSolver Methods plus :: Weight -> Offset -> Weight #
Plus (SizeExpr' r f) Offset (SizeExpr' r f) #	Add offset to size expression.
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods plus :: SizeExpr' r f -> Offset -> SizeExpr' r f #

newtype Rigid #

Fixed size variables i.

Constructors

RigidId
Fields rigidId :: String

Instances

Eq Rigid #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (==) :: Rigid -> Rigid -> Bool # (/=) :: Rigid -> Rigid -> Bool #
Ord Rigid #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compare :: Rigid -> Rigid -> Ordering # (<) :: Rigid -> Rigid -> Bool # (<=) :: Rigid -> Rigid -> Bool # (>) :: Rigid -> Rigid -> Bool # (>=) :: Rigid -> Rigid -> Bool # max :: Rigid -> Rigid -> Rigid # min :: Rigid -> Rigid -> Rigid #
Show Rigid #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> Rigid -> ShowS # show :: Rigid -> String # showList :: [Rigid] -> ShowS #
Pretty Rigid #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Rigid -> Doc # prettyPrec :: Int -> Rigid -> Doc # prettyList :: [Rigid] -> Doc #

newtype Flex #

Size meta variables X to solve for.

Constructors

FlexId
Fields flexId :: String

Instances

Eq Flex #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (==) :: Flex -> Flex -> Bool # (/=) :: Flex -> Flex -> Bool #
Ord Flex #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compare :: Flex -> Flex -> Ordering # (<) :: Flex -> Flex -> Bool # (<=) :: Flex -> Flex -> Bool # (>) :: Flex -> Flex -> Bool # (>=) :: Flex -> Flex -> Bool # max :: Flex -> Flex -> Flex # min :: Flex -> Flex -> Flex #
Show Flex #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> Flex -> ShowS # show :: Flex -> String # showList :: [Flex] -> ShowS #
Pretty Flex #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Flex -> Doc # prettyPrec :: Int -> Flex -> Doc # prettyList :: [Flex] -> Doc #

data SizeExpr' rigid flex #

Size expressions appearing in constraints.

Constructors

Const	Constant number `n`.
Fields offset :: Offset
Rigid	Variable plus offset `i + n`.
Fields rigid :: rigid offset :: Offset
Infty	Infinity `∞`.
Flex	Meta variable `X + n`.
Fields flex :: flex offset :: Offset

Instances

Ord f => Substitute r f (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> SizeExpr' r f -> SizeExpr' r f #
Flexs flex (SizeExpr' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods flexs :: SizeExpr' rigid flex -> Set flex #
Rigids r (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods rigids :: SizeExpr' r f -> Set r #
Subst Term (SizeExpr' NamedRigid SizeMeta) #	Only for `raise`.
Instance details Defined in Agda.TypeChecking.SizedTypes.Solve Methods applySubst :: Substitution' Term -> SizeExpr' NamedRigid SizeMeta -> SizeExpr' NamedRigid SizeMeta #
Functor (SizeExpr' rigid) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods fmap :: (a -> b) -> SizeExpr' rigid a -> SizeExpr' rigid b # (<$) :: a -> SizeExpr' rigid b -> SizeExpr' rigid a #
Foldable (SizeExpr' rigid) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods fold :: Monoid m => SizeExpr' rigid m -> m # foldMap :: Monoid m => (a -> m) -> SizeExpr' rigid a -> m # foldr :: (a -> b -> b) -> b -> SizeExpr' rigid a -> b # foldr' :: (a -> b -> b) -> b -> SizeExpr' rigid a -> b # foldl :: (b -> a -> b) -> b -> SizeExpr' rigid a -> b # foldl' :: (b -> a -> b) -> b -> SizeExpr' rigid a -> b # foldr1 :: (a -> a -> a) -> SizeExpr' rigid a -> a # foldl1 :: (a -> a -> a) -> SizeExpr' rigid a -> a # toList :: SizeExpr' rigid a -> [a] # null :: SizeExpr' rigid a -> Bool # length :: SizeExpr' rigid a -> Int # elem :: Eq a => a -> SizeExpr' rigid a -> Bool # maximum :: Ord a => SizeExpr' rigid a -> a # minimum :: Ord a => SizeExpr' rigid a -> a # sum :: Num a => SizeExpr' rigid a -> a # product :: Num a => SizeExpr' rigid a -> a #
Traversable (SizeExpr' rigid) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods traverse :: Applicative f => (a -> f b) -> SizeExpr' rigid a -> f (SizeExpr' rigid b) # sequenceA :: Applicative f => SizeExpr' rigid (f a) -> f (SizeExpr' rigid a) # mapM :: Monad m => (a -> m b) -> SizeExpr' rigid a -> m (SizeExpr' rigid b) # sequence :: Monad m => SizeExpr' rigid (m a) -> m (SizeExpr' rigid a) #
(Eq rigid, Eq flex) => Eq (SizeExpr' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (==) :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Bool # (/=) :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Bool #
(Ord rigid, Ord flex) => Ord (SizeExpr' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compare :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Ordering # (<) :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Bool # (<=) :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Bool # (>) :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Bool # (>=) :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> Bool # max :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> SizeExpr' rigid flex # min :: SizeExpr' rigid flex -> SizeExpr' rigid flex -> SizeExpr' rigid flex #
(Show rigid, Show flex) => Show (SizeExpr' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> SizeExpr' rigid flex -> ShowS # show :: SizeExpr' rigid flex -> String # showList :: [SizeExpr' rigid flex] -> ShowS #
(Pretty r, Pretty f) => Pretty (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: SizeExpr' r f -> Doc # prettyPrec :: Int -> SizeExpr' r f -> Doc # prettyList :: [SizeExpr' r f] -> Doc #
TruncateOffset (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods truncateOffset :: SizeExpr' r f -> SizeExpr' r f #
ValidOffset (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods validOffset :: SizeExpr' r f -> Bool #
Plus (SizeExpr' r f) Offset (SizeExpr' r f) #	Add offset to size expression.
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods plus :: SizeExpr' r f -> Offset -> SizeExpr' r f #
Plus (SizeExpr' r f) Label (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.WarshallSolver Methods plus :: SizeExpr' r f -> Label -> SizeExpr' r f #
Plus (SizeExpr' r f) Weight (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.WarshallSolver Methods plus :: SizeExpr' r f -> Weight -> SizeExpr' r f #

type SizeExpr = SizeExpr' Rigid Flex #

data Cmp #

Comparison operator, e.g. for size expression.

Constructors

Lt	`<`.
Le	`≤`.

Instances

Bounded Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods minBound :: Cmp # maxBound :: Cmp #
Enum Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods succ :: Cmp -> Cmp # pred :: Cmp -> Cmp # toEnum :: Int -> Cmp # fromEnum :: Cmp -> Int # enumFrom :: Cmp -> [Cmp] # enumFromThen :: Cmp -> Cmp -> [Cmp] # enumFromTo :: Cmp -> Cmp -> [Cmp] # enumFromThenTo :: Cmp -> Cmp -> Cmp -> [Cmp] #
Eq Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (==) :: Cmp -> Cmp -> Bool # (/=) :: Cmp -> Cmp -> Bool #
Ord Cmp #	Comparison operator is ordered `Lt < Le`.
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compare :: Cmp -> Cmp -> Ordering # (<) :: Cmp -> Cmp -> Bool # (<=) :: Cmp -> Cmp -> Bool # (>) :: Cmp -> Cmp -> Bool # (>=) :: Cmp -> Cmp -> Bool # max :: Cmp -> Cmp -> Cmp # min :: Cmp -> Cmp -> Cmp #
Show Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> Cmp -> ShowS # show :: Cmp -> String # showList :: [Cmp] -> ShowS #
Dioid Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compose :: Cmp -> Cmp -> Cmp # unitCompose :: Cmp #
MeetSemiLattice Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods meet :: Cmp -> Cmp -> Cmp #
Top Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods top :: Cmp # isTop :: Cmp -> Bool #
Pretty Cmp #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Cmp -> Doc # prettyPrec :: Int -> Cmp -> Doc # prettyList :: [Cmp] -> Doc #

data Constraint' rigid flex #

Constraint: an inequation between size expressions, e.g. X < ∞ or i + 3 ≤ j.

Constructors

Constraint
Fields leftExpr :: SizeExpr' rigid flex cmp :: Cmp rightExpr :: SizeExpr' rigid flex

Instances

PrettyTCM SizeConstraint #	Assumes we are in the right context.
Instance details Defined in Agda.TypeChecking.SizedTypes.Solve Methods prettyTCM :: SizeConstraint -> TCM Doc #
Subst Term SizeConstraint #
Instance details Defined in Agda.TypeChecking.SizedTypes.Solve Methods applySubst :: Substitution' Term -> SizeConstraint -> SizeConstraint #
Ord f => Substitute r f (Constraint' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> Constraint' r f -> Constraint' r f #
Ord flex => Flexs flex (Constraint' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods flexs :: Constraint' rigid flex -> Set flex #
Ord r => Rigids r (Constraint' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods rigids :: Constraint' r f -> Set r #
Functor (Constraint' rigid) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods fmap :: (a -> b) -> Constraint' rigid a -> Constraint' rigid b # (<$) :: a -> Constraint' rigid b -> Constraint' rigid a #
Foldable (Constraint' rigid) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods fold :: Monoid m => Constraint' rigid m -> m # foldMap :: Monoid m => (a -> m) -> Constraint' rigid a -> m # foldr :: (a -> b -> b) -> b -> Constraint' rigid a -> b # foldr' :: (a -> b -> b) -> b -> Constraint' rigid a -> b # foldl :: (b -> a -> b) -> b -> Constraint' rigid a -> b # foldl' :: (b -> a -> b) -> b -> Constraint' rigid a -> b # foldr1 :: (a -> a -> a) -> Constraint' rigid a -> a # foldl1 :: (a -> a -> a) -> Constraint' rigid a -> a # toList :: Constraint' rigid a -> [a] # null :: Constraint' rigid a -> Bool # length :: Constraint' rigid a -> Int # elem :: Eq a => a -> Constraint' rigid a -> Bool # maximum :: Ord a => Constraint' rigid a -> a # minimum :: Ord a => Constraint' rigid a -> a # sum :: Num a => Constraint' rigid a -> a # product :: Num a => Constraint' rigid a -> a #
Traversable (Constraint' rigid) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods traverse :: Applicative f => (a -> f b) -> Constraint' rigid a -> f (Constraint' rigid b) # sequenceA :: Applicative f => Constraint' rigid (f a) -> f (Constraint' rigid a) # mapM :: Monad m => (a -> m b) -> Constraint' rigid a -> m (Constraint' rigid b) # sequence :: Monad m => Constraint' rigid (m a) -> m (Constraint' rigid a) #
(Show rigid, Show flex) => Show (Constraint' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> Constraint' rigid flex -> ShowS # show :: Constraint' rigid flex -> String # showList :: [Constraint' rigid flex] -> ShowS #
(Pretty r, Pretty f) => Pretty (Constraint' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Constraint' r f -> Doc # prettyPrec :: Int -> Constraint' r f -> Doc # prettyList :: [Constraint' r f] -> Doc #

type Constraint = Constraint' Rigid Flex #

Polarities to specify solutions.

data Polarity #

What type of solution are we looking for?

Constructors

Least
Greatest

Instances

Eq Polarity #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods (==) :: Polarity -> Polarity -> Bool # (/=) :: Polarity -> Polarity -> Bool #
Ord Polarity #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods compare :: Polarity -> Polarity -> Ordering # (<) :: Polarity -> Polarity -> Bool # (<=) :: Polarity -> Polarity -> Bool # (>) :: Polarity -> Polarity -> Bool # (>=) :: Polarity -> Polarity -> Bool # max :: Polarity -> Polarity -> Polarity # min :: Polarity -> Polarity -> Polarity #
Pretty Polarity #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Polarity -> Doc # prettyPrec :: Int -> Polarity -> Doc # prettyList :: [Polarity] -> Doc #

data PolarityAssignment flex #

Assigning a polarity to a flexible variable.

Constructors

PolarityAssignment Polarity flex

Instances

Pretty flex => Pretty (PolarityAssignment flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: PolarityAssignment flex -> Doc # prettyPrec :: Int -> PolarityAssignment flex -> Doc # prettyList :: [PolarityAssignment flex] -> Doc #

type Polarities flex = Map flex Polarity #

Type of solution wanted for each flexible.

emptyPolarities :: Polarities flex #

polaritiesFromAssignments :: Ord flex => [PolarityAssignment flex] -> Polarities flex #

getPolarity :: Ord flex => Polarities flex -> flex -> Polarity #

Default polarity is Least.

Solutions.

newtype Solution rigid flex #

Partial substitution from flexible variables to size expression.

Constructors

Solution
Fields theSolution :: Map flex (SizeExpr' rigid flex)

Instances

Ord f => Substitute r f (Solution r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> Solution r f -> Solution r f #
(Show flex, Show rigid) => Show (Solution rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods showsPrec :: Int -> Solution rigid flex -> ShowS # show :: Solution rigid flex -> String # showList :: [Solution rigid flex] -> ShowS #
Null (Solution rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods empty :: Solution rigid flex # null :: Solution rigid flex -> Bool #
(Pretty r, Pretty f) => Pretty (Solution r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods pretty :: Solution r f -> Doc # prettyPrec :: Int -> Solution r f -> Doc # prettyList :: [Solution r f] -> Doc #

emptySolution :: Solution r f #

class Substitute r f a where #

Executing a substitution.

Minimal complete definition

subst

Methods

subst :: Solution r f -> a -> a #

Instances

Substitute r f a => Substitute r f [a] #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> [a] -> [a] #
Ord f => Substitute r f (Solution r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> Solution r f -> Solution r f #
Substitute r f a => Substitute r f (Map k a) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> Map k a -> Map k a #
Ord f => Substitute r f (Constraint' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> Constraint' r f -> Constraint' r f #
Ord f => Substitute r f (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods subst :: Solution r f -> SizeExpr' r f -> SizeExpr' r f #

Constraint simplification

type CTrans r f = Constraint' r f -> Either String [Constraint' r f] #

simplify1 :: (Pretty f, Pretty r, Eq r) => CTrans r f -> CTrans r f #

Returns an error message if we have a contradictory constraint.

ifLe :: Cmp -> a -> a -> a #

Le acts as True, Lt as False.

compareOffset :: Offset -> Cmp -> Offset -> Bool #

Interpret Cmp as relation on Offset.

Printing

Wellformedness

class ValidOffset a where #

Offsets + n must be non-negative

Minimal complete definition

validOffset

Methods

validOffset :: a -> Bool #

Instances

ValidOffset Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods validOffset :: Offset -> Bool #
ValidOffset (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods validOffset :: SizeExpr' r f -> Bool #

class TruncateOffset a where #

Make offsets non-negative by rounding up.

Minimal complete definition

truncateOffset

Methods

truncateOffset :: a -> a #

Instances

TruncateOffset Offset #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods truncateOffset :: Offset -> Offset #
TruncateOffset (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods truncateOffset :: SizeExpr' r f -> SizeExpr' r f #

Computing variable sets

class Rigids r a where #

The rigid variables contained in a pice of syntax.

Minimal complete definition

rigids

Methods

rigids :: a -> Set r #

Instances

(Ord r, Rigids r a) => Rigids r [a] #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods rigids :: [a] -> Set r #
Ord r => Rigids r (Constraint' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods rigids :: Constraint' r f -> Set r #
Rigids r (SizeExpr' r f) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods rigids :: SizeExpr' r f -> Set r #

class Flexs flex a | a -> flex where #

The flexibe variables contained in a pice of syntax.

Minimal complete definition

flexs

Methods

flexs :: a -> Set flex #

Instances

Flexs SizeMeta HypSizeConstraint #
Instance details Defined in Agda.TypeChecking.SizedTypes.Solve Methods flexs :: HypSizeConstraint -> Set SizeMeta #
(Ord flex, Flexs flex a) => Flexs flex [a] #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods flexs :: [a] -> Set flex #
Ord flex => Flexs flex (Constraint' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods flexs :: Constraint' rigid flex -> Set flex #
Flexs flex (SizeExpr' rigid flex) #
Instance details Defined in Agda.TypeChecking.SizedTypes.Syntax Methods flexs :: SizeExpr' rigid flex -> Set flex #