A reference to a model element, either directly or via its Alf abstract syntax representation. (NOTE: The definitions of all the helper operations of ElementReference are specific to its subclasses.) ElementReference true A direct reference to a UML model element. The Alf syntax element that represents the referenced model element. element public InternalElementReference A syntax element synthesized in an abstract syntax tree, along with any additional information determined during static semantic analysis. SyntaxElement true A direct reference to a UML model element. The referenced model element. element public ExternalElementReference An assignment of a source element that gives the value of a local name, along with a record of the defined type (if any) and multiplicity of the local name. If the subtype of an assigned source is empty, then its known type is the same as its type. Otherwise, its known type is the same as its subtype. English assignedSourceKnownTypeDerivation The local name for which this is the assigned source. name public A reference to the element that is to be the source for the assigned value of the given local name. source public The multiplicity upper bound for the local name. upper public The multiplicity lower bound for the name. lower public A reference to the element that gives the type for the local name (if any). type public composite A reference to the element that gives the best known type for the latest assignment to the local name (if any). This will always be a subtype of the type of the assigned source. subtype public A reference to the element that represents the best known type for the local name. knownType public true AssignedSource A syntax element that has documentation comments associated with it. The documentation text to be associated with a syntax element. Each string is intended to be mapped to the body of a comment element in the target UML model. * documentation public DocumentedElement true externalElementReference public A_element_externalElementReference * assignedSource public A_subtype_assignedSource * assignedSource public A_knownType_assignedSource assignedSource public A_type_assignedSource * assignedSource public A_source_assignedSource internalElementReference public A_element_internalElementReference The left-hand side of an assignment expression. NOTE: The derivations for the derived properties of LeftHandSide are specific to its various subclasses. If a left-hand side has an index, then the index expression must have a multiplicity upper bound no greater than 1. English leftHandSideIndexExpression * assignmentBefore public true The assignments after the left-hand side. * assignmentAfter public true An optional expression that evaluates to an index into the values of an ordered sequence. index public composite A reference to the assignable element denoted by this left-hand side, if one exists (i.e., the left-hand side is not for the first assignment of a local name). referent public true A reference to the element that specifies the statically determined type of this left-hand side (if any). type public true The statically determined lower bound of the multiplicity of this left-hand side. lower public true The statically determined upper bound of the multiplicity of this left-hand side. upper public true LeftHandSide true An expression comprising the keyword “this”. The static type of a this expression is the statically determined context classifier for the context in which the this expression occurs. English thisExpressionTypeDerivation The multiplicity upper bound of a this expression is always 1. English thisExpressionUpperDerivation The multiplicity lower bound of a this expression is always 1. English thisExpressionLowerDerivation ThisExpression A left-hand side that is a name. If a name left-hand side has an index, then the assignments after the left-hand side are the same as the assignments after the index. If the left-hand side has no index, but its target disambiguates to a feature reference, then the assignments after the left-hand side are the assignments after the feature expression. Otherwise the assignments after the left-hand side are the same as the assignments before the left-hand side. English nameLeftHandSideAssignmentAfterDerivation The target of a name left hand side may not already have an assigned source that is a loop variable definition, an annotation, a sequence expansion expression or a parameter that is an in parameter. English nameLeftHandSideTargetAssignment If the target of a name left-hand side disambiguates to a feature reference, then the assignments before the expression of the feature reference are the assignments before the left-hand side. If a name left-hand side has an index, then the target must either disambiguate to a feature reference or already have an assigned source, and the assignments before the index expression are the assignments before the left-hand side or, if the target disambiguates to a feature reference, the assignments after the expression of the feature reference. English nameLeftHandSideAssignmentsBefore If the target of a name left-hand side disambiguates to a structural feature, then the referent of the left-hand side is that feature. If the target resolves to a parameter, then the referent is that parameter. If the target resolves to a local name, then the referent is the assigned source for that local name, if it has one. English nameLeftHandSideReferentDerivation If a name left-hand side is indexed, then its lower bound is 0. Otherwise, if the left-hand side is for a local name with an assignment, than its lower bound is that of the assignment, else, if it has a referent, then its lower bound is that of the referent. English nameLeftHandSideLowerDerivation If a name left-hand side is indexed, then its upper bound is 1. Otherwise, if the left-hand side is for a local name with an assignment, than its upper bound is that of the assignment, else, if it has a referent, then its upper bound is that of the referent. English nameLeftHandSideUpperDerivation If a name left-hand side is for a local name with an assignment, then its type is that of that assignment. Otherwise, if the left-hand side has a referent, then its type is the type of that referent. English nameLeftHandSideTypeDerivation If the target of a name left-hand side is qualified, then, if it does not disambiguate to a feature, it must have a referent that is a parameter of an operation or behavior that is the current scope the left-hand is in, and, if it does disambiguate to a feature, it must have a single referent that is a structural feature. English nameLeftHandSideTargetResolution If the target of a name left-hand side disambiguates to a feature reference, and the left-hand side has an index, then the referent of the feature reference must be ordered and non-unique. English nameLeftHandSideIndexedFeature The target of a name left-hand side must not have a template binding. English nameLeftHandSideNontemplateTarget If the target of a name left-hand side disambiguates to a feature reference, then the expression of the feature reference must have a multiplicity upper bound of 1. English nameLeftHandSideFeatureExpression The name that is the target of the assignment. target public composite NameLeftHandSide A template binding in which the arguments are matched to formal template parameters in order by position. The arguments for this template binding, to be matched by position to the template parameters. * argumentName public composite PositionalTemplateBinding A sequence expansion expression with a forAll, exists or one operation. A forAll, exists or one expression has the type Boolean. English forAllOrExistsOrOneExpressionTypeDerivation A forAll, exists or one expression has a multiplicity lower bound of 1. English forAllOrExistsOrOneExpressionLowerDerivation A forAll, exists or one expression has a multiplicity upper bound of 1. English forAllOrExistsOrOneExpressionUpperDerivation The argument of a forAll, exists or one expression must have a type that conforms to type Boolean and a multiplicity upper bound of 1. English forAllOrExistsOrOneExpressionArgument ForAllOrExistsOrOneExpression A reference to a structural or behavioral feature of the type of its target expression or a binary association end the opposite end of which is typed by the type of its target expression. The features referenced by a feature reference include the features of the type of the target expression and the association ends of any binary associations whose opposite ends are typed by the type of the target expression. English featureReferenceReferentDerivation The target expression of the feature reference may not be untyped, nor may it have a primitive or enumeration type. English featureReferenceTargetType The target expression. expression public composite The features referenced by this feature reference. * referent public true The name of the feature. nameBinding public composite FeatureReference A BitString unary expression has type BitString. English bitStringUnaryExpressionTypeDerivation A BitString unary expression a multiplicity lower bound of 1. English bitStringUnaryExpressionLowerDerivation A BitString unary expression has a multiplicity upper bound of 1. English bitStringUnaryExpressionUpperDerivation The operand expression of a BitString unary expression must have a type that conforms to BitString or Integer and multiplicity upper and lower bounds of 1. English bitStringUnaryExpressionOperand BitString conversion is required if the operand expression of a BitString unary expression has a type that conforms to type Integer. English bitStringUnaryExpressionIsBitStringConversionDerivation Whether BitString conversion is required on the operand expression. isBitStringConversion public true BitStringUnaryExpression A binary expression with a logical operator. A logical expression has type Boolean if it is not bit-wise and type BitString if it is bit-wise. English logicalExpressionTypeDerivation A logical expression has a multiplicity lower bound of 1. English logicalExpressionLowerDerivation A logical expression has a multiplicity upper bound of 1. English logicalExpressionUpperDerivation The operands of a logical expression must have a type that conforms to type Boolean, Integer or BitString. However, if one of the operands is Boolean, then the other must also be Boolean. English logicalExpressionOperands BitString conversion is required if the first operand expression of a logical expression has a type that conforms to type Integer. English logicalExpressionIsBitStringConversion1Derivation BitString conversion is required if the second operand expression of a logical expression has a type that conforms to type Integer. English logicalExpressionIsBitStringConversion2Derivation A logical expression is bit-wise if the type of its first operand is not Boolean. English logicalExpressionIsBitWiseDerivation Whether this is a bit-wise logical operation on bit strings. isBitWise public true Whether the first operand expression requires BitString conversion. isBitStringConversion1 public true Whether the second operand expression requires BitString conversion. isBitStringConversion2 public true LogicalExpression An expression used to obtain the objects in the extent of a class. The type of a class extent expression is the given class. English classExtentExpressionTypeDerivation The multiplicity upper bound of a class expression is *. English classExtentExpressionUpperDerivation The multiplicity lower bound of a class extent expression is 0. English classExtentExpressionLowerDerivation The given type name must resolve to a non-template class. English classExtentExpressionExtentType The name of the class whose extent is to be obtained. className public composite ClassExtentExpression An expression that comprises a real literal. The type of a real literal expression is the Alf library type Real. English realLiteralExpressionTypeDerivation The textual image of the literal token for this expression. image public RealLiteralExpression A specification of the substitution of an argument type name for a template parameter. The name of the template parameter. parameterName public The name of the argument type. argumentName public composite TemplateParameterSubstitution A binary expression that tests the equality of its operands. An equality expression is negated if its operator is "!=". English equalityExpressionIsNegatedDerivation An equality expression has type Boolean. English equalityExpressionTypeDerivation An equality expression has a multiplicity lower bound of 1. English equalityExpressionLowerDerivation An equality expression has a multiplicity upper bound of 1. English equalityExpressionUpperDerivation An equality expression requires Real conversion if the first operand is of a type that conforms to type Integer and the second is of a type that conforms to type Real. English equalityExpressionIsRealConversion1Derivation An equality expression requires Real conversion if the first operand is of type Real and the second is of type Integer . English equalityExpressionIsRealConversion2Derivation Whether the test is for being not equal. isNegated public true Whether Real conversion is required on the first operand of this expression. isRealConversion1 public true Whether Real conversion is required on the second operand of this expression. isRealConversion2 public true If the one operand expression has multiplicity 0..0, then check the other operand expression for known nulls and non-nulls, using the exclusive-or of the given truth condition and whether the equality expression is negated or not. * assignments public condition public * result public return adjustAssignments public The minimum lower bound is 0 for operands of equality expressions. result public return minLowerBound public EqualityExpression A named argument expression for an output parameter. The equivalent left-hand side for an output named expression depends on the kind of expression. If the expression is a name expression with no disambiguation, then the left-hand side is a name left-hand side with the name from the name expression. If the expression is a name expression that disambiguates to a feature reference, then the left-hand side is a feature left-hand side for that feature reference. If the expression is a property access expression, then the left-hand side is a feature left-hand side for the feature reference of the property access expression. If the expression is a sequence access expression, then the left-hand side is a name left-hand side or feature left-hand side, as above, depending on whether the primary expression of the sequence access expression is a name expression or property access expression, and an index given by the index expression of the sequence access expression. Otherwise the left-hand side is empty. English outputNamedExpressionLeftHandSideDerivation The argument for an output parameter must be either be null, a name expression, a property access expression, or a sequence access expression whose primary expression is a name expression or a property access expression. English outputNamedExpressionForm The argument expression considered as an assignment left-hand side. leftHandSide public composite true OutputNamedExpression A model of the common properties derived for any Alf expression. NOTE: The derivations for all properties of Expression except AssignmentsAfter are specific to its various subclasses. The assignments after an expression are given by the result of the updateAssignments helper operation. English expressionAssignmentAfterDerivation No name may be assigned more than once before or after an expression. English expressionUniqueAssignments The assigned sources for local names available lexically before this expression. * assignmentBefore public true The assigned sources for local names available lexically after this expression. This includes not only any assignments made within the expression, but also any assignments that are unchanged from before the expression. * assignmentAfter public true The statically determined upper bound of the multiplicity of this expression. upper public true The statically determined lower bound of the multiplicity of this expression. lower public true A reference to the element that specifies the statically determined type for this expression (if any). type public true Returns the assignments from before this expression updated for any assignments made in the expression. By default, this is the same set as the assignments before the expression. This operation is redefined only in subclasses of Expression for kinds of expressions that make assignments. * result public return updateAssignments public Returns the given assignments, adjusted for known nulls, known non-nulls and best known types, based on the given truth condition. By default, no changes are made. (This operation is overridden for conditional logical, binary unary, equality, behavior invocation, sequence operation and classification expressions that may be used to form checks for null and non-null values and type classification.) * assignments public condition public * result public return adjustAssignments public Returns the given assignments, adjusted for known nulls and non-nulls, based on the given truth condition. By default, no changes are made. (This operation is overridden for name and assignment expressions that may be used to provide the names that are checked for being null or non-null.) * assignments public condition public * result public return adjustMultiplicity public Returns the given assignments, adjusted for the given best-known subtype. By default, no changes are made. (This operation is overridden by name and assignment expressions that may be used to provide the names that are checked for type classification.) * assignments public subtype public * result public return adjustType public Return the type of the expression, based on the originally declared types of names in the expression. By default, this is the expression type. result public return declaredType public Expression true A binary expression with a relational operator. A relational expression is an UnlimitedNatural comparison if either one of its operands has type UnlimitedNatural. English relationalExpressionIsUnlimitedNaturalDerivation The type of a relational expression is Boolean. English relationalExpressionTypeDerivation A relational expression has a multiplicity lower bound of 0 if the lower bound if either operand expression is 0 and 1 otherwise. English relationalExpressionLowerDerivation A relational expression has a multiplicity upper bound of 1. English relationalExpressionUpperDerivation The operand expressions for a comparison operator must both be of a type that conforms to type Natural, Integer or Real, or both be of a type that conforms to type Natural or UnlimitedNatural. English relationalExpressionOperandTypes A relational expression requires Real conversion if it is a Real comparison and its first operand is of a type that conforms to type Integer. English relationalExpressionIsRealConversion1Derivation A relational expression requires Real conversion if it is a Real comparison and its second operand is of a type that conforms to type Integer. English relationalExpressionIsRealConversion2Derivation A relational expression is a Real comparison if either one of its operations has a type that conforms to type Real. English relationalExpressionIsRealDerivation Whether this is an UnlimitedNatural comparison. isUnlimitedNatural public true Whether this is a Real comparison. isReal public true Whether Real conversion is required on the first operand of this expression. isRealConversion1 public true Whether Real conversion is required on the second operand of this expression. isRealConversion2 public true The minimum lower bound is 0 for operands of relational expressions (this allows for the propagation of a null returned from an arithmetic expression used as an operand). result public return minLowerBound public RelationalExpression A tuple in which the arguments are matched to parameters in order by position. A positional tuple must not have more arguments than the invocation it is for has parameters. English positionalTupleArguments The argument expressions for this tuple, to be matched by position to the invocation parameters. * expression public true composite PositionalTuple An unqualified name, optionally with a template binding. The template binding to be used, if the name denotes a template. binding public composite An unqualified name. For names that appeared as unrestricted names in the input text, the string value here excludes the surrounding single quote characters and has any escape sequences resolved to the denoted special characters. name public NameBinding A specification of the elements of a sequence. The multiplicity upper bound of the elements of the sequence. The derivation for this property is given in the subclasses of SequenceElements. upper public true The multiplicity lower bound of the elements of the sequence. The derivation for this property is given in the subclasses of SequenceElements. lower public true SequenceElements true An invocation of a behavior referenced by name. If the target of a behavior invocation expression resolves to a behavior, then the referent of the expression is that behavior. If the target disambiguates to a feature reference, then the reference is the operation or signal being invoked. Otherwise, if the target resolves to a property that is an association end, then the referent is that property. English behaviorInvocationExpressionReferentDerivation If the target qualified name disambiguates to a feature reference, then the feature of a behavior invocation expression is that feature reference. English behaviorInvocationExpressionFeatureDerivation If the target qualified name does not disambiguate to a feature reference, then it must resolve to a behavior or an association end, and, if it is a template behavior, then the implicit binding of this template must be legal. Otherwise it must resolve to a single feature referent according to the overloading resolution rules, unless it is an implicit destructor call (in which case it has no referent). English behaviorInvocationExpressionReferentConstraint If the target qualified name does not disambiguate to a feature reference, then each input argument expression must be assignable to its corresponding parameter and each output argument expression must be assignable from its corresponding parameter. (Note that this implies that the type of an argument expression for an inout parameter must be the same as the type of that parameter.) English behaviorInvocationExpressionArgumentCompatibility The referent may only be a constructor (as a result of the target disambiguating to a feature reference) if this behavior invocation expression is the expression of an expression statement that is the first statement in the definition for the method of a constructor operation. English behaviorInvocationExpressionAlternativeConstructor The qualified name of the behavior to be invoked. target public composite If the invoked behavior is CollectionFunctions::isEmpty or SequenceFunctions::IsEmpty, then check the argument expression for known nulls and non-nulls using the given truth condition. If the invoked behavior is CollectionFunctions::notEmpty or SequenceFunctions::NotEmpty, then check the argument expression for known nulls and non-nulls using the negation of the given truth condition. * assignments public condition public * result public return adjustAssignments public BehaviorInvocationExpression A specification of the elements of a sequence as a range of integers. The multiplicity lower bound of a sequence range is 0. English sequenceRangeLowerDerivation The multiplicity uper bound of a sequence range is * (since it is not possible, in general, to statically determine a more constrained upper bound). English sequenceRangeUpperDerivation Both expression in a sequence range must have a multiplicity upper bound of 1. English sequenceRangeExpressionMultiplicity A local name may be defined or reassigned in at most one of the expressions of a sequence range. English sequenceRangeAssignments The expression whose value gives the lower bound for the range. rangeLower public composite The expression whose value gives the upper bound for the range. rangeUpper public composite SequenceRange An expression that comprises a name reference. If the name in a name expression is a local name or parameter name for an out parameter, then its assignment is its assigned source before the expression. If the name is a parameter name for an in or inout parameter, then its assignment is its assigned source before the expression, if it has one, and, otherwise, it is a new assignment whose source is the named parameter and whose type and multiplicity are those of the parameter. English nameExpressionAssignmentDerivation If the name in a name expression resolves to an enumeration literal name, then that is the enumeration literal for the expression. English nameExpressionEnumerationLiteralDerivation If the name in a name expression disambiguates to a feature reference, then the equivalent property access expression has the disambiguation of the name as its feature. The assignments before the property access expression are the same as those before the name expression. English nameExpressionPropertyAccessDerivation The type of a name expression is determined by its name. If the name is a local name or parameter with an assignment, then the type of the name expression is the best known type of that assignment. If the name is an enumeration literal, then the type of the name expression is the corresponding enumeration. If the name disambiguates to a feature reference, then the type of the name expression is the type of the equivalent property access expression. English nameExpressionTypeDerivation The multiplicity upper bound of a name expression is determined by its name. English nameExpressionUpperDerivation The multiplicity lower bound of a name expression is determined by its name. English nameExpressionLowerDerivation If the name referenced by this expression is not a disambiguated feature reference or a local or parameter name, then it must resolve to exactly one enumeration literal. English nameExpressionResolution The identified enumeration literal, if the referenced name is for an enumeration literal. enumerationLiteral public true The assigned source for the referenced name, if the name is a local or parameter name. assignment public true The equivalent property access expression, if the referenced name disambiguates to a feature reference. propertyAccess public composite true The qualified name referenced in this expression. (For a local name, this will actually have no qualification.) name public composite If propertyAccess is not empty (i.e., if the referenced name disambiguates to a feature reference), then return the assignments after the propertyAccess expression. Otherwise, return the result of the superclass updateAssignments operation. * result public return updateAssignments public If the name does not disambiguate to a feature reference, then it is considered known null if the condition is true and known non-null if the condition is false. * assignments public condition public * result public return adjustMultiplicity public If the name does not disambiguate to a feature reference, then it is considered to have the given subtype. * assignments public subtype public * result public return adjustType public If a name expression has a derived assignment, then its declared type is the type of that assignment. Otherwise it is the same as the type of the expression. result public return declaredType public NameExpression An expression used to filter values by type. The type of a cast expression is the referent of the given type name (if there is one). English castExpressionTypeDerivation If the type of a cast expression is empty, or its type conforms to Integer and the type of its operand expression conforms to BitString or Real, or its type conforms to BitString or Real and its operand's type conforms to Integer, or its operand's type conforms to its type, then the multiplicity lower bound of the cast expression is the same as that of its operand expression. Otherwise it is 0. English castExpressionLowerDerivation A cast expression has a multiplicity upper bound that is the same as the upper bound of its operand expression. English castExpressionUpperDerivation If the cast expression has a type name, then it must resolve to a non-template classifier. English castExpressionTypeResolution The assignments before the operand of a cast expression are the same as those before the cast expression. English castExpressionAssignmentsBefore The operand expression of the cast expression. operand public composite The named type of the cast expression (if any) typeName public composite The assignments after a cast expression are the same as those after its operand expression. * result public return updateAssignments public CastExpression A specification of the elements of a sequence using a list of expressions. The multiplicity lower bound of the elements of a sequence expression list is given by the sum of the lower bounds of each of the expressions in the list. English sequenceExpressionListLowerDerivation The multiplicity upper bound of the elements of a sequence expression list is given by the sum of the upper bounds of each of the expressions in the list. If any of the expressions in the list have an unbounded upper bound, then the sequence expression list also has an unbounded upper bound. English sequenceExpressionListUpperDerivation The list of expressions whose values determine the elements of the sequence. * element public true composite SequenceExpressionList An expression that comprises a natural literal. The type of a natural literal is the Alf library type Natural. NOTE: If the context of a natural literal expression unambiguously requires either an Integer or an UnlimitedNatural value, then the result of the literal expression is implicitly downcast to the required type. If the context is ambiguous, however, than an explicit cast to Integer or UnlimitedNatural must be used. English naturalLiteralExpressionTypeDerivation The textual image of the literal token for this expression. image public NaturalLiteralExpression An expression used to reduce a sequence of values effectively by inserting a binary operation between the values. The referent for a sequence reduction expression is the behavior denoted by the behavior name of the expression. English sequenceReductionExpressionReferentDerivation A sequence reduction expression has the same type as its primary expression. English sequenceReductionExpressionTypeDerivation A sequence reduction expression has a multiplicity upper bound of 1. English sequenceReductionExpressionUpperDerivation A sequence reduction expression has a multiplicity lower bound of 1. English sequenceReductionExpressionLowerDerivation The behavior name in a sequence reduction expression must denote a behavior. English sequenceReductionExpressionBehavior The referent behavior must have two in parameters, a return parameter and no other parameters. The parameters must all have the same type as the argument expression and multiplicity [1..1]. English sequenceReductionExpressionBehaviorParameters The assignments before the target expression of a sequence reduction expression are the same as the assignments before the sequence reduction expression. English sequenceReductionExpressionAssignmentsBefore A reference to the behavior to be used as the reducer. referent public true Whether this is an ordered reduction or not. isOrdered public The target class name or primary expression for the reduction. primary public composite The name of the behavior to be used as the reducer. behaviorName public composite The assignments after a sequence reduction expression are the same as after its primary expression. * result public return updateAssignments public SequenceReductionExpression A list of expressions used to provide the arguments for an invocation. A tuple has the same number of inputs as its invocation has input parameters. For each input parameter, the tuple has a corresponding input with the same name as the parameter and an expression that is the matching argument from the tuple, or an empty sequence construction expression if there is no matching argument. English tupleInputDerivation A tuple has the same number of outputs as its invocation has output parameters. For each output parameter, the tuple has a corresponding output with the same name as the parameter and an expression that is the matching argument from the tuple, or an empty sequence construction expression if there is no matching argument. English tupleOutputDerivation An input parameter may only have a null argument if it has a multiplicity lower bound of 0. English tupleNullInputs An output parameter may only have a null argument if it is an out parameter. English tupleOutputs The assignments before each expression in a tuple are the same as the assignments before the tuple, except in the case of a name expression that defines a new local name, in which case the assigned source for the new name is included in the assignments before the name expression. (Note that the assigned source for a new name is included before the name expression so that the nameExpressionResolution constraint is not violated.) The assignments before the tuple are the same as the assignments after the feature reference of the invocation of the tuple, if the invocation has one, or otherwise the assignments before the invocation. English tupleAssignmentsBefore A name may be assigned in at most one argument expression of a tuple. English tupleAssignmentsAfter The argument expressions from this tuple, matched to the input parameters (direction in and inout) of the invocation. An empty sequence construction expression is included for any input parameter that is not explicitly matched in the tuple. * input public composite true The invocation expression of which this tuple is a part. invocation public The argument expressions from this tuple, matched to the output parameters (direction inout and out) of the invocation. An empty sequence construction expression is included for any output parameter that is not explicitly matched in the tuple. * output public composite true Tuple true A binary expression with an arithmetic operator. An arithmetic expression is a string concatenation expression if its type is String. English arithmeticExpressionIsConcatenationDerivation If both operands of an arithmetic expression operator are of a type that conforms to type Integer, then the type of the expression is Integer. If one operand is of a type that conforms to type Real and the other Integer or both are of a type that conforms to type Real, then the type of the expression is Real. If both operands are of a type that conforms to type String, then the type of the expression is String. Otherwise the expression has no type. English arithmeticExpressionTypeDerivation An arithmetic expression has a multiplicity lower bound of 0 if the operator is / or if the lower bound if either operand expression is 0 and 1 otherwise. English arithmeticExpressionLowerDerivation An arithmetic expression has a multiplicity upper bound of 1. English arithmeticExpressionUpperDerivation The operands of an arithmetic expression must both have types that conform to type Integer or Real, unless the operator is + or %. If the operator is +, then both operands may also have types that conform to type String. If the operator is %, then both operands must have types that conform to type Integer. English arithmeticExpressionOperandTypes Real conversion is required if the type of an arithmetic expression is Real and the first operand expression has a type that conforms to type Integer. English arithmeticExpressionIsRealConversion1Derivation Real conversion is required if the type of an arithmetic expression is Real and the second operand expression has a type that conforms to type Integer. English arithmeticExpressionIsRealConversion2Derivation An arithmetic expression is a real computation if its type conforms to Real. English arithmeticExpressionIsRealDerivation The operand expressions of an arithmetic expressions must both have multiplicity upper bounds of 1. English arithmeticExpressionOperandMultiplicity Whether this is a string concatenation expression. isConcatenation public true Whether this is a real arithmetic expression. isReal public true Whether Real conversion is required on the first operand of this expression. isRealConversion1 public true Whether Real conversion is required on the second operand of this expression. isRealConversion2 public true The minimum lower bound is 0 for operands of arithmetic expressions other than concatenations (this allows for the propagation of a null returned from a division by zero in an operand). result public return minLowerBound public ArithmeticExpression A sequence expansion expression with a select or reject operation. A select or reject expression has the same type as its primary expression. English selectOrRejectExpressionTypeDerivation A select or reject expression has a multiplicity lower bound of 0. English selectOrRejectExpressionLowerDerivation A select or reject expression has the same multiplicity upper bound as its primary expression. English selectOrRejectExpressionUpperDerivation The argument of a select or reject expression must have a type that conforms to type Boolean and a multiplicity upper bound of 1. English selectOrRejectExpressionArgument SelectOrRejectExpression A tuple in which the arguments are matched to parameters by name. The name of a named expression of a named tuple must be the name of a parameter of the invocation the tuple is for. No two named expressions may have the same name. English namedTupleArgumentNames The argument expressions for this tuple paired with the corresponding parameter names. * namedExpression public true composite NamedTuple An expression consisting of an operator acting on a single operand expression. The assignments before the operand of a unary expression are the same as those before the unary expression. English unaryExpressionAssignmentsBefore The symbol representing the operator. operator public The expression giving the operand. operand public composite By default, the assignments after a unary expression are the same as those after its operand expression. * result public return updateAssignments public UnaryExpression true An invocation of a feature referenced on a sequence of instances. If a feature invocation expression is an implicit object destruction, it has no referent. Otherwise, its referent is the operation or signal being invoked. English featureInvocationExpressionReferentDerivation If a feature invocation expression has an explicit target, then that is its feature. Otherwise, it is an alternative constructor call with its feature determined implicitly. English featureInvocationExpressionFeatureDerivation If a feature invocation expression is not an implicit destructor call, then it must be possible to determine a single valid referent for it according to the overloading resolution rules. English featureInvocationExpressionReferentExists An alternative constructor invocation may only occur in an expression statement as the first statement in the definition for the method of a constructor operation. English featureInvocationExpressionAlternativeConstructor If there is no target feature expression, then the implicit feature with the same name as the target type must be a constructor. English featureInvocationExpressionImplicitAlternativeConstructor A feature reference to the target feature to be invoked. target public composite FeatureInvocationExpression An expression denoting the invocation of a behavior or operation, or the sending of a signal. An invocation expression is a behavior invocation if its referent is a behavior. English invocationExpressionIsBehaviorDerivation An invocation expression is an association end read if its referent is an association end. English invocationExpressionIsAssociationEndDerivation An invocation expression is an operation call if its referent is an operation. English invocationExpressionIsOperationDerivation An invocation expression is a destructor call either implicitly or if it is an explicit operation call to a destructor operation. English invocationExpressionIsDestructorDerivation An invocation expression is an implicit object destruction if it has a feature with the name "destroy" and no explicit referents. English invocationExpressionIsImplicitDerivation An invocation expression is a signal send if its referent is a signal. English invocationExpressionIsSignalDerivation The parameters of an invocation expression are given by the result of the parameterElements helper operation. English invocationExpressionParameterDerivation If the (bound) referent of an invocationExpression is an operation or behavior with a return parameter, then the type of the expression is that of the return parameter (if any). If the referent is a classifier, then the type is the referent. If the referent is a property, then the type is that of the property. Otherwise the expression has no type. English invocationExpressionTypeDerivation If the referent of an invocationExpression is an operation or behavior with a return parameter, then the upper bound of the expression is that of the return parameter. If the referent is a classifier, then the upper bound is 1. If the referent is a property, then the upper bound is that of the property. Otherwise the upper bound is 0. English invocationExpressionUpperDerivation If the referent of an invocationExpression is an operation or behavior with a return parameter, then the lower bound of the expression is that of the return parameter. If the referent is a classifier, then the lower bound is 1. If the referent is a property, then the lower bound is that of the property. Otherwise the lower bound is 0. English invocationExpressionLowerDerivation The assignments before the target expression of the feature reference of an invocation expression (if any) are the same as the assignments before the invocation expression. English invocationExpressionAssignmentsBefore If the referent of an invocation expression is a template behavior, then the bound referent is the implicit template binding of this template; otherwise it is the same as the referent. For an implicit template binding, the type arguments of for the template are inferred from the types of the arguments for in and inout parameters of the template behavior. If the resulting implicit template binding would not be a legal binding of the template behavior, then the invocation expression has no bound referent. English invocationExpressionBoundReferentDerivation If the referent of the invocation expression is a template, then all of its template parameters must be classifier template parameters. Note: This allows for the possibility that the referent is not an Alf unit, in which case it could have non-classifier template parameters. English invocationExpressionTemplateParameters If the invocation is a sequence feature invocation, then the assignments after the tuple of the invocation expression must be the same as the assignments before. English invocationExpressionAssignmentsAfter Whether this is a behavior invocation or not. isBehavior public true Whether this is an association read or not. isAssociationEnd public true For an invocation of a feature, the reference to that feature. This property is set for a feature invocation expression or for an expression initially parsed as a behavior invocation expression that disambiguates to a feature invocation expression. feature public true The tuple for the invocation expression. tuple public composite Whether this is an operation call or not. isOperation public true If this is an operation call, whether the operation is a destructor. isDestructor public true Whether this is an implicit object destruction. isImplicit public true The behavior, operation or signal being invoked. The derivation of this property is specific to each kind of invocation expression. referent public true Element references to the parameters of the referent, in order. * parameter public true true Whether this is a signal send or not. isSignal public true If the referent of the invocation expression is a template behavior, then the implicit bound element for the referent, otherwise the same as the referent. boundReferent public true Returns references to the elements that act as the parameters of the referent. If the (bound) referent is a behavior or operation, these are the owned parameters, in order. If the referent is an association end, then the parameters are the other association ends of the association of the referent end, which are treated as if they were in parameters. Otherwise (by default), they are any properties of the referent (e.g., signal attributes), which are treated as if they were in parameters. (This is defined as a helper operation, so that it can be overridden by subclasses of InvocationExpression, if necessary.) * true result public return parameterElements public The assignments after an invocation expression are the same as those after the tuple of the expression. * result public return updateAssignments public InvocationExpression true A binary expression with a conditional logical expression, for which the evaluation of the second operand expression is conditioned on the result of evaluating the first operand expression. A conditional logical expression has type Boolean. English conditionalLogicalExpressionTypeDerivation A conditional logical expression has a multiplicity lower bound of 1. English conditionalLogicalExpressionLowerDerivation A conditional logical expression has a multiplicity upper bound of 1. English conditionalLogicalExpressionUpperDerivation The operands of a conditional logical expression must have a type that conforms to type Boolean. English conditionalLogicalExpressionOperands The assignments before the first operand expression of a conditional logical expression are the same as those before the conditional logical expression. The assignments before the second operand expression are the same as those after the first operand expression, adjusted for known nulls and non-nulls based on the first operand expression being true, for a conditional-and expression, or false, for a conditional-or expression. result public return validateAssignments public If a name has the same assigned source after the second operand expression as before it, then that is its assigned source after the conditional logical expression. Otherwise its assigned source after the conditional logical expression is the conditional logical expression itself. If a name is unassigned before the second operand expression but assigned after it, then it has a multiplicity lower bound of 0 after the conditional logical expression. * result public return updateAssignments public ConditionalLogicalExpression An invocation expression used to invoke an operation of a superclass. The referent of a super invocation expression is the method behavior of the operation identified using the overloading resolution rules. English superInvocationExpressionReferentDerivation There is no feature for a super invocation. English superInvocationExpressionFeatureDerivation If the target has a qualification, then this must resolve to one of the superclasses of the current context class. English superInvocationExpressionQualification If the target is empty, the referent must be the method for a constructor operation and the context class for the behavior containing the super invocation expression must have exactly one superclass. English superInvocationExpressionImplicitTarget If the referent is the method of a constructor operation, the super invocation expression must occur in an expression statement at the start of the definition for the method of a constructor operation, such that any statements preceding it are also super constructor invocations. English superInvocationExpressionConstructorCall If the referent is the method of a destructor operation, the super invocation expression must occur in an within the method of a destructor operation. English superInvocationExpressionDestructorCall It must be possible to identify a single valid operation denoted by the target of a super invocation expression that satisfies the overloading resolution rules. English superInvocationExpressionOperation The name of the operation to be invoked, optionally qualified with the name of the appropriate superclass. target public composite SuperInvocationExpression A sequence expansion expression with a isUnique. An isUnique expression has the type Boolean. English isUniqueExpressionTypeDerivation An isUnique expression has a multiplicity lower bound of 1. English isUniqueExpressionLowerDerivation An isUnique expression has a multiplicity upper bound of 1. English isUniqueExpressionUpperDerivation The argument of an isUnique expression must have a multiplicity upper bound of 1. English isUniqueExpressionExpressionArgument IsUniqueExpression The target of a sequence operation, reduction or expansion expression, which may be either a primary expression or a class name denoting the class extent. The effective expression for the target is the parsed primary expression, if the target is not a qualified name, a name expression, if the target is a qualified name other than a class name, or a class extent expression, if the target is the qualified name of a class. English extentOrExpressionExpressionDerivation If the target is a qualified name, then that name, before it is disambiguated into either a name expression or a class name. name public composite The effective expression for the target. expression public composite true The target primary expression, if it is not a qualified name. nonNameExpression public composite ExtentOrExpression A sequence expansion expression with a collect or iterate operation. A collect or iterate expression has the same type as its argument expression. English collectOrIterateExpressionTypeDerivation A collect or iterate expression has a multiplicity lower bound that is the product of the bounds of its primary and argument expressions. English collectOrIterateExpressionLowerDerivation A collect or iterate expression has a multiplicity upper bound that is the product of the bounds of its primary and argument expressions. English collectOrIterateExpressionUpperDerivation CollectOrIterateExpression A unary expression with a Boolean operator. A Boolean unary expression has type Boolean. English booleanUnaryExpressionTypeDerivation A Boolean unary expression has the same multiplicity lower bound as its operand expression. English booleanUnaryExpressionLowerDerivation A Boolean unary expression has a multiplicity upper bound of 1. English booleanUnaryExpressionUpperDerivation The operand expression of a Boolean unary expression must have a type that conforms to type Boolean and a multiplicity upper bound of 1. English booleanUnaryExpressionOperand If the expression is a negation, then check the operand expression for known nulls and non-nulls based on the negation of the given truth condition. * assignments public condition public * result public return adjustAssignments public BooleanUnaryExpression An expression used to assign a value to a local name, parameter or property. An assignment expression is a simple assignment if the assignment operator is "=". English assignmentExpressionIsSimpleDerivation An assignment expression is an arithmetic assignment if its operator is a compound assignment operator for an arithmetic operation. English assignmentExpressionIsArithmeticDerivation An assignment expression is a definition if it is a simple assignment and its left hand side is a local name for which there is no assignment before the expression. English assignmentExpressionIsDefinitionDerivation The left hand side of an assignment expression is a feature if it is a feature left-hand side or a name left-hand side for a name that disambiguates to a feature. English assignmentExpressionIsFeatureDerivation The left hand side of an assignment expression is indexed if it has an index. English assignmentExpressionIsIndexedDerivation An assignment expression is a data value update if its left hand side is an attribute of a data value held in a local name or parameter. English assignmentExpressionIsDataValueUpdateDerivation he new assigned source for an assignment to a local name is the assignment expression (including a data value update). If the assignment is a definition, then the type is given by the right-side, otherwise the type is the same as for the previous assigned source for the local name. The multiplicity lower bound is 0 if the lower bound of the right-hand side is 0 and otherwise 1, and the multiplicity upper bound is 1 if the upper bound of the right-hand side is 1 and * otherwise, except that: if the left-hand side is a data-value update, the multiplicity is the same as for the previous assignment, and, if the left-hand side is indexed (but not a data-value update), the multiplicity is [0..*]. If the assignment expression does not require any conversions, then the subtype of the assignment is the type of the right-hand side expression; otherwise it is null. English assignmentExpressionAssignmentDerivation If the left-hand side of an assignment expression is a feature, then the feature of the assignment is the referent of the left-hand side. English assignmentExpressionFeatureDerivation For a compound assignment, the effective expression is the left-hand side treated as a name expression, property access expression or sequence access expression, as appropriate for evaluation to obtain the original value to be updated. English assignmentExpressionExpressionDerivation A simple assignment expression has the same type as its right-hand side expression. A compound assignment expression has the same type as its left-hand side. English assignmentExpressionTypeDerivation An assignment expression has the same multiplicity upper bound as its right-hand side expression. English assignmentExpressionUpperDerivation A simple assignment expression has the same multiplicity lower bound as its right-hand side expression. A compound assignment expression has the same multiplicity as its left-hand side. English assignmentExpressionLowerDerivation If the left-hand side of a simple assignment is not a new local name, and the right-hand side is not null, then either the left-hand side must be untyped or the right-hand side expression must have a type that conforms to the type of the left-hand side. English assignmentExpressionSimpleAssignmentTypeConformance If the left-hand side of a simple assignment is not a local name and the multiplicity lower bound of the left-hand side is greater than 0, then the multiplicity lower bound of the right-hand side cannot be 0. If the left-hand side is not a new local name and the multiplicity upper bound of the left-hand side is less than or equal to 1, then the multiplicity upper bound of the right-hand side cannot be greater than that of the left-hand side. English assignmentExpressionSimpleAssignmentMultiplicityConformance For a compound assignment, if the operator is an arithmetic operator, then either the left-hand side and the right-hand side both have types that conform to type Integer, the left-hand side has a type that conforms to type Real and the right-hand side has a type that conformst to type Integer or Real, or they both have a type that conforms to type String and the operator is +. If the operator is a logical operator, then either the left-hand side and the right-hand side both have types that conform to type Boolean or Bit String or the left-hand side has a type that conforms to type Bit String and the right-hand side has a type that conforms to type Integer. If the operator is a shift operator, then the left-hand side must have a type that conforms to type Bit String and the right-hand side must have a type that conforms to type Integer. English assignmentExpressionCompoundAssignmentTypeConformance For a compound assignment, both the left-hand and right-hand sides must have a multiplicity upper bound of 1. English assignmentExpressionCompoundAssignmentMultiplicityConformance The assigned source of a name before the right-hand side expression of an assignment expression is the same as the assigned source before the assignment expression. The assigned source of a name before the left-hand side is the assigned source after the right-hand side expression. English assignmentExpressionAssignmentsBefore An assignment requires collection conversion if the type of the right-hand side is a collection class and its multiplicity upper bound is 1, and the type of the left-hand side is not a collection class. English assignmentExpressionIsCollectionConversionDerivation An assignment requires BitString conversion if the type of the left-hand side is BitString and either the type of the right-hand side is Integer or collection conversion is required and the type of the right-hand side is a collection class whose sequence type is Integer. English assignmentExpressionIsBitStringConversionDerivation If an assignment expression has a feature with a primary expression whose type is a data type, then the assignment expression must be a data value update. English assignmentExpressionDataValueUpdateLegality An assignment requires Real conversion if the type of the left-hand side conforms to Real and either the type of the right-hand side conforms to Integer or collection conversion is required and the type of the right-hand side is a collection class whose sequence type conforms to Integer. English assignmentExpressionIsRealConversionDerivation The image of the assignment operator used in the expression. operator public The left-hand side of the assignment, to which a value is to be assigned. leftHandSide public composite The right-hand side expression of the assignment, which produces the value being assigned. rightHandSide public composite If the left-hand side is a name, then the new assigned source for that name. assignment public true If the left-hand side is a feature, then the referent for that feature. feature public true If the left-hand side is a feature, whether it has an index or not. isIndexed public true If this is a compound assignment, whether the compound assignment operator is arithmetic or not. isArithmetic public true Whether this assignment is the definition of a new local name or not. isDefinition public true Whether this is a simple assignment or not. isSimple public true If this is a compound assignment, then the effective expression used to obtain the original value of the left-hand side to be updated. expression public composite true Whether the left-hand side is a feature or not. isFeature public true Whether this assignment updates an attribute of a data value held in a local name or parameter. isDataValueUpdate public true Whether collection conversion is required for this assignment. isCollectionConversion public true Whether BitString conversion is required for this assignment. isBitStringConversion public true Whether Real conversion is required for this assignment. isRealConversion public true The assignments after an assignment expression are the assignments after the left-hand side, updated by the assignment from the assignment statement, if any. * result public return updateAssignments public If the left-hand side is not indexed and is not a feature reference, then the assigned name is considered be known null if the condition is true, or known non-null if the condition is false. The right-hand side is then also checked for known nulls or non-nulls. * assignments public condition public * result public return adjustMultiplicity public If the left-hand side is not indexed and is not a feature reference, then the assigned name is considered to have the given subtype. The type of the right-hand side is then also adjusted as appropriate. * assignments public subtype public * result public return adjustType public If an assignment expression is a simple assignment, then its declared type is the declared type of the right-hand side expression. Otherwise it is the type of the assignment expression. result public return declaredType public AssignmentExpression An expression used to create or destroy the links of an association. A link operation expression is for link creation if its operation is "createLink". English linkOperationExpressionIsCreationDerivation A link operation expression is for clearing an association if the operation is "clearAssoc". English linkOperationExpressionIsClearDerivation The referent for a link operation expression is the named association. English linkOperationExpressionReferentDerivation There is no feature for a link operation expression. English linkOperationExpressionFeatureDerivation The qualified name of a link operation expression must resolve to a single association. English linkOperationExpressionAssociationReference Each argument expression must be assignable to its corresponding expression. English linkOperationExpressionArgumentCompatibility The name of the link operation. operation public Whether the operation is for link creation. isCreation public true Whether the operation is clearing the association. isClear public true The qualified name of the association whose links are being acted on. associationName public composite For a clear association operation, returns a single, typeless parameter. Otherwise, returns the ends of the named association. * result public return parameterElements public LinkOperationExpression An expression used to test the dynamic type of its operand. A classification expression is direct if its operator is "hastype". English classificationExpressionIsDirectDerivation The referent of a classification expression is the classifier to which the type name resolves. English classificationExpressionReferentDerivation A classification expression has type Boolean. English classificationExpressionTypeDerivation A classification expression has a multiplicity lower bound of 1. English classificationExpressionLowerDerivation A classification expression has a multiplicity upper bound of 1. English classificationExpressionUpperDerivation The type name in a classification expression must resolve to a non-template classifier. English classificationExpressionTypeName The operand expression of a classification expression must have a multiplicity upper bound of 1. English classificationExpressionOperand Whether the test is for the operand to have the given type directly or to only conform to the given type. referent public true Whether the test is for the operand to have the given type directly or to only conform to the given type. isDirect public true The name of the type that the operand is to be tested against. typeName public composite If the truth condition is true and the type of the operand of a classification expression does not conform to the referent type of the classification expression, then set the known type of the operand of the classification expression to be the referent type of the classification expression. * assignments public condition public * result public return adjustAssignments public ClassificationExpression An expression that comprises a String literal. The type of a string literal expression is String. English stringLiteralExpressionTypeDerivation The textual image of the literal token for this expression, with quote characters removed and escaped sequences resolved to the denoted special character. image public StringLiteralExpression A shift expression has type BitString. English shiftExpressionTypeDerivation A shift expression has a multiplicity lower bound of 1. English shiftExpressionLowerDerivation A shift expression has a multiplicity upper bound of 1. English shiftExpressionUpperDerivation The first operand expression of a shift expression must have a type that conforms to the type BitString or Integer. The second operand expression must have a type that conforms to the type Integer. English shiftExpressionOperands BitString conversion is required if the first operand expression of a shift expression has a type that conforms to type Integer. English shiftExpressionIsBitStringConversionDerivation Whether the first operand expression requires BitString conversion. isBitStringConversion public true ShiftExpression An expression that comprises a primitive literal. The multiplicity upper bound of a literal expression is always 1. English literalExpressionUpperDerivation The multiplicity lower bound of a literal expression is always 1. English literalExpressionLowerDerivation LiteralExpression true An expression used to construct a sequence of values. If the type name of a sequence construction expression is not empty, then the type of the expression is the classifier to which the type name resolves. English sequenceConstructionExpressionTypeDerivation If a sequence construction expression has multiplicity, then its multiplicity upper bound is given by its elements, if this is not empty, and zero otherwise. If a sequence construction expression does not have multiplicity, then its multiplicity upper bound is one. English sequenceConstructionExpressionUpperDerivation If a sequence construction expression has multiplicity, then its multiplicity lower bound is given by its elements, if this is not empty, and zero otherwise. If a sequence construction expression does not have multiplicity, then its multiplicity lower bound is one. English sequenceConstructionExpressionLowerDerivation If the type name of a sequence construction expression is not empty, then it must resolve to a non-template classifier. If the expression does not have multiplicity, then its type must be a collection class. English sequenceConstructionExpressionType If the elements of a sequence construction expression are given by a sequence range, then the expression must have a type that conforms to type Integer. If the elements are given by a sequence element list, and the sequence construction expression has a non-empty type, then each expression in the list must have a type that either conforms to the type of the sequence construction expression or is convertible to it by bit string conversion or real conversion. English sequenceConstructionExpressionElementType If the elements of a sequence construction expression are given by a sequence expression list, then the assignments before the first expression in the list are the same as the assignments before the sequence construction expression, and the assignments before each subsequent expression are the assignments after the previous expression. If the elements are given by a sequence range, the assignments before both expressions in the range are the same as the assignments before the sequence construction expression. English sequenceConstructionExpressionAssignmentsBefore The specification of the elements in the sequence. elements public composite Whether the sequence construction expression has a multiplicity indicator. hasMultiplicity public The name of the type of the elements in the sequence. typeName public composite If the elements of the sequence construction expression are given by a sequence expression list, then return the assignments after the last expression in the list (if the list is empty, then return the assignments before the sequence construction expression). If the elements are given by a sequence range, then return the union of the assignments after each of the expressions in the range. * result public return updateAssignments public SequenceConstructionExpression A template binding in which the arguments are matched to formal template parameters by name. The substitutions of arguments for template parameters. * substitution public composite NamedTemplateBinding An expression that comprises a Boolean literal. The type of a boolean literal expression is Boolean. English booleanLiteralExpressionTypeDerivation The textual image of the literal token for this expression. image public BooleanLiteralExpression The representation of a qualified name as a sequence of individual simple names. The unqualified name of a qualified name is the last name binding. English qualifiedNameUnqualifiedNameDerivation The path name for a qualified name consists of the string representation of each of the name bindings, separated by "::" punctuation. The string representation of a name binding is its name followed by the representation of its template binding, if it has one. The string representation of a positional template binding consists of an ordered list of the path names of its argument qualified names separated by commas, all surrounded by the angle brackets "<" and ">". The string representation of a named template binding consists of an ordered list of its template parameter substitutions, each consisting of the formal parameter name followed by "=>" followed by the path name of the argument qualified name, separated by commas, all surrounded by the angle brackets "<" and ">". English qualifiedNamePathNameDerivation A qualified name is a feature reference is its disambiguation is not empty. English qualifiedNameIsFeatureReferenceDerivation The qualification of a qualified name is a empty if the qualified name has only one name binding. Otherwise it is the qualified name consisting of all the name bindings of the original qualified name except for the last one. The qualification of a qualified name is considered ambiguous if the qualified name is ambiguous and has more than two name bindings. English qualifiedNameQualificationDerivation If a qualified name is not ambiguous or it has a qualification that resolves to a namespace, then it is has no disambiguation. Otherwise, its disambiguation is a feature reference with a name given by the unqualified name of the qualified name and a target expression determined by the disambiguation of the qualification of the qualified name. English qualifiedNameDisambiguationDerivation The referents of a qualified name are the elements to which the name may resolve in the current scope, according to the UML rules for namespaces and named elements. English qualifiedNameReferentDerivation If a qualified name is a local name, then the reference must be within the same local scope as the definition of the named element. English qualifiedNameLocalName If a qualified name is an unqualified, non-local name, then it must be visible in the current scope of the use of the name. English qualifiedNameNonLocalUnqualifiedName If a qualified name has a qualification, then its unqualified name must name an element of the namespace named by the qualification, where the first name in the qualification must name an element of the current scope. English qualifiedNameQualifiedResolution If the unqualified name of a qualified name has a template binding, then the template name must resolve to a template. The template binding must have an argument name for each of the template parameters and each argument name must resolve to a classifier. If the template parameter has constraining classifiers, then the referent of the corresponding argument name must conform to all those constraining classifiers. English qualifiedNameTemplateBinding If the last name binding in a qualified name has a template binding, then the template name is a qualified name with the same template bindings as the original qualified name, but with the template binding removed on the last name binding. English qualifiedNameTemplateNameDerivation Whether this qualified name is ambiguous. isAmbiguous public The complete path name for the qualified name, with individual name bindings separated by "::" punctuation. pathName public true Indicates whether this qualified name has been disambiguated to a feature reference. isFeatureReference public true The qualified name corresponding to the qualification part of this qualified name, if any. qualification public composite true The disambiguation into a feature reference of a syntactic element initially parsed as a qualified name. disambiguation public composite true The sequence of individual name bindings in this qualified name. * nameBinding public true composite The possible referents to which this qualified name may resolve. (Note that the UML rules for namespaces in general allow a namespace to contain elements of different kinds with the same name.) If the qualified name is for a template instantiation, then the referent is the equivalent bound element. * referent public true The rightmost individual name binding in the qualified name, without the qualification. unqualifiedName public true If this qualified name is for a template binding, then the name of the template for which this qualified name is a binding. templateName public composite true QualifiedName A unary expression with a numeric operator. If the operand of a numeric unary expression is of type Integer, then the expression is Integer. Of the operand is of type Real, then the type of the expression is Real. Otherwise it has no type. English numericUnaryExpressionTypeDerivation A numeric unary expression has the same multiplicity lower bound as its operand expression. English numericUnaryExpressionLowerDerivation A numeric unary expression has a multiplicity upper bound of 1. English numericUnaryExpressionUpperDerivation The operand expression must have a type that conforms to type Integer and a multiplicity upper bound of 1. English numericUnaryExpressionOperand NumericUnaryExpression An expression that uses the value of one operand expression to condition the evaluation of one of two other operand expressions. The type of a conditional-test operator expression is the effective common ancestor (if one exists) of the types of its second and third operand expressions. English conditionalTestExpressionTypeDerivation The multiplicity lower bound of a conditional-test operator expression is the minimum of the multiplicity lower bounds of its second and third operand expressions. English conditionalTestExpressionLowerDerivation The multiplicity upper bound of a conditional-test operator expression is the maximum of the multiplicity upper bounds of its second and third operand expressions. English conditionalTestExpressionUpperDerivation The first operand expression of a conditional-test expression must be of a type that conforms to type Boolean and have multiplicity lower and upper bounds of 1. English conditionalTestExpressionCondition The assignments before the first operand expression of a conditional-test expression are the same as those before the conditional-test expression. The assignments before the second and third operand expressions are the same as those after the first operand expression. English conditionalTestExpressionAssignmentsBefore The first operand expression, which provides the condition to be tested. operand1 public composite The second operand expression, to be evaluated if the condition is true. operand2 public composite The third operand expression, to be evaluated if the condition is false. operand3 public composite Returns unchanged all assignments for local names that are not reassigned in either the second or third operand expressions. Any local names that have different assignments after the second and third operand expressions are adjusted to have the conditional-test expression as their assigned source. If such a local name is defined in one operand expression but not the other, then it is adjusted to have multiplicity lower bound of 0 after the conditional test expression. If a local name has a new assignment after each of the second and third expressions, then, after the conditional-test expression, it has a type that is the effective common ancestor of its type after the second and third operand expressions, adjusted for known null and non-null names from the first operand expression being true, for the second operand expression, or false, for the third operand expression, a multiplicity lower bound that is the minimum of the lower bounds after the second and third operand expressions and a multiplicity upper bound that is the maximum of the upper bounds after the second and third expressions. * result public return updateAssignments public ConditionalTestExpression An expression that comprises an unbounded value literal. The type of an unbounded literal expression is UnlimitedNatural. English unboundedLiteralExpressionTypeDerivation UnboundedLiteralExpression A pairing of a parameter name and an argument expression in a tuple. Collection conversion is required if the type of the corresponding parameter is a collection class and the type of the argument expression is not. English namedExpressionIsCollectionConversionDerivation Bit string conversion is required if the type of the type of the corresponding parameter is BitString, or a collection class whose sequence type is BitString, and the type of the argument expression is not BitString. English namedExpressionIsBitStringConversionDerivation Real conversion is required if the type of the corresponding parameter conforms to Real, or a collection class whose sequence type conforms to Real, and the type of the argument expression is not Real. English namedExpressionIsRealDerivation The parameter name. name public The argument expression. expression public composite An expression whose value gives an index into an ordered parameter. (This is only used in link operation expressions.) index public composite Whether the argument expression requires collection conversion. isCollectionConversion public true Whether the argument expression requires bit string conversion. isBitStringConversion public true Whether the argument expression requires Real conversion. isRealConversion public true NamedExpression An expression used to access a specific element of a sequence. The type of a sequence access expression is the same as the type of its primary expression. English sequenceAccessExpressionTypeDerivation The multiplicity lower bound of a sequence access expression is 0. English sequenceAccessExpressionLowerDerivation The multiplicity upper bound of a sequence access expression is 1. English sequenceAccessExpressionUpperDerivation The type of the index of a sequence access expression must be Integer. English sequenceAccessExpressionIndexType The multiplicity upper bound of the index of a sequence access expression must be 1. English sequenceAccessExpressionIndexMultiplicity The expression whose value is the sequence being accessed. primary public composite The expression whose value is the index of the element being accessed in the sequence. index public composite SequenceAccessExpression An expression used to invoke a behavior as if it was an operation on a target sequence as a whole. The referent for a sequence operation expression is the behavior named by the operation for the expression. If any resolution of the operation name is a template behavior, then the implicit template binding of that behavior, if legal, is used to check the assignability of the target primary expression. English sequenceOperationExpressionReferentDerivation There is no feature for a sequence operation expression. English sequenceOperationExpressionFeatureDerivation There must be a single behavior that is a resolution of the operation qualified name of a sequence operation expression with a least one parameter, whose first parameter has direction in or inout, has multiplicity [0..*] and to which the target primary expression is assignable. English sequenceOperationExpressionOperationReferent If the first parameter of the referent has direction inout, then the parameter type must have the same type as the primary expression, the primary expression must have the form of a left-hand side and, if the equivalent left-hand side is for a local name, that name must already exist. The first parameter must be assignable to the effective left-hand side. English sequenceOperationExpressionTargetCompatibility The type of an input argument expression of a sequence operation parameter must be assignable to its corresponding parameter. The type of an output parameter must be assignable to its corresponding argument expression. (Note that this implies that the type of an argument expression for an inout parameter must be the same as the type of that parameter.) English sequenceOperationExpressionArgumentCompatibility The assignments before the primary expression of a sequence operation expression are the same as the assignments before the sequence operation expression. English sequenceOperationExpressionAssignmentsBefore Collection conversion is required if the type of the primary expression of a sequence operation expression is a collection class and the multiplicity upper bound of the primary expression is 1. English sequenceOperationExpressionIsCollectionConversionDerivation BitString conversion is required if type of the first parameter of the referent of a sequence operation expression is BitString and either the type of its primary expression is Integer or collection conversion is required and the type of its primary expression is a collection class whose sequence type is Integer. English sequenceOperationExpressionIsBitStringConversionDerivation A local name that is assigned in the primary expression of a sequence operation expression may not be assigned in any expression in the tuple of the sequence operation expression. English sequenceOperationExpressionAssignmentsAfter If the operation of a sequence operation expression has a first parameter whose direction is inout, then the effective left-hand side for the expression is constructed as follows: If the primary is a name expression, then the left-hand side is a name left-hand side with the name from the name expression as its target. If the primary is a property access expression, then the left-hand side is a feature left hand side with the feature reference from the property access expression as its feature. If the primary is a sequence access expression whose primary is a name expression or a property access expression, then the left-hand side is constructed from the primary of the sequence access expression as given previously and the index of the sequence access expression becomes the index of the left-hand side. English sequenceOperationExpressionLeftHandSideDerivation The expression or class name whose value is gives the sequence to be operated on. primary public composite The qualified name of the behavior being invoked. operation public composite Whether the primary expression requires collection conversion. isCollectionConversion public true Whether type primary expression requires BitString conversion. isBitStringConversion public true The effective left-hand side corresponding to the primary expression, if the sequence operation is “in place” (that is, has a first parameter with direction inout). leftHandSide public composite true The assignments after a sequence operation expression include those made in the primary expression and those made in the tuple and, for an "in place" operation (one whose first parameter is inout), that made by the sequence operation expression itself. * result public return updateAssignments public Returns the list of parameter elements from the superclass operation, with the first parameter removed (since the argument for the first parameter is given by the primary expression of a sequence operation expression, not in its tuple). * result public return parameterElements public If the invoked behavior is CollectionFunctions::isEmpty or SequenceFunctions::IsEmpty, then check the primary expression for known nulls and non-nulls using the given truth condition. If the invoked behavior is CollectionFunctions::notEmpty or SequenceFunctions::NotEmpty, then check the primary expression for known nulls and non-nulls using the negation of the given truth condition. * assignments public condition public * result public return adjustAssignments public SequenceOperationExpression A left-hand side that is a property reference. The assignments before the expression of the feature reference of a feature left-hand side are the assignments before the feature left-hand side. English featureLeftHandSideAssignmentBeforeDerivation The assignments after a feature left-hand side are the assignments after the expression of the feature reference or, if there is an index, those after the index expression. English featureLeftHandSideAssignmentAfterDerivation The expression of the feature reference of a feature left-hand side must have a multiplicity upper bound of 1. English featureLeftHandSideFeatureExpression If a feature left-hand side has an index, then the assignments before the index expression are the assignments after the expression of the feature reference. English featureLeftHandSideAssignmentsBefore The referent of a feature left-hand side is the structural feature to which the feature reference of the left-hand side resolves. English featureLeftHandSideReferentDerivation The type of a feature left-hand side is the type of its referent. English featureLeftHandSideTypeDerivation If a feature left-hand side is indexed, then its lower bound is 0. Otherwise, its lower bound is that of its referent. English featureLeftHandSideLowerDerivation If a feature left-hand side is indexed, then its upper bound is 1. Otherwise, its upper bound is that of its referent. English featureLeftHandSideUpperDerivation The feature of a feature-left hand side must have a single referent that is a structural feature. English featureLeftHandSideReferentConstraint If a feature left-hand side has an index, then the referent of the feature must be ordered and non-unique. English featureLeftHandSideIndexedFeature The structural feature being assigned. feature public composite FeatureLeftHandSide An expression used to evaluate its operand expression in isolation. An isolation expression has the type of its operand expression. English isolationExpressionTypeDerivation An isolation expression has the multiplicity lower bound of its operand expression. English isolationExpressionLowerDerivation An isolation expression has the multiplicity upper bound of its operand expression. English isolationExpressionUpperDerivation IsolationExpression An expression comprising a reference to a structural feature. The feature of a property access expression is the structural feature to which its feature reference resolves. English propertyAccessExpressionFeatureDerivation The type of a property access expression is the type of the referenced feature. English propertyAccessExpressionTypeDerivation The multiplicity upper bound of a property access expression is given by the product of the multiplicity upper bounds of the referenced feature and the target expression. English propertyAccessExpressionUpperDerivation The multiplicity lower bound of a property access expression is given by the product of the multiplicity lower bounds of the referenced feature and the target expression. English propertyAccessExpressionLowerDerivation The feature reference for a property access expression must resolve to a single structural feature. English propertyAccessExpressionFeatureResolution The assignments before the expression of the feature reference of a property access expression are the same as before the property access expression. English propertyAccessExpressionAssignmentsBefore A reference to a structural feature. featureReference public composite The referenced structural feature. feature public true The assignments after a property access expression are the same as those after the target expression of its feature reference. * result public return updateAssignments public PropertyAccessExpression An expression that evaluates to the result of its first operand expression, unless that result is null and it has a second operand expression, in which case it evaluates to the result of its second operand expression. The assignments before the first operand expression of a null-coalescing expression are the same as those before the null-coalescing expression. The assignments before the second operand expression are the same as those after the first operand expression. English nullCoalescingExpressionAssignmentsBefore The multiplicity lower bound of a null-coalescing expression is the multiplicity lower bound of its first greater than 0; otherwise it is 1, if the multiplicity lower bound of its second operand expression is greater than 0; otherwise, it is 0. English nullCoalescingExpressionLowerDerivation If one of the operand expressions of a null-coalescing expression is identically null (untyped with multiplicity 0..0), then the type of the null-coalescing expression is the same as the type of the other operand expressions. Otherwise, the type of a null-coalescing expression is the effective common ancestor of the types of its operands, if one exists, and empty, if it does not. English nullCoalescingExpressionTypeDerivation The multiplicity upper bound of a null-coalescing expression is the maximum of the multiplicity upper bounds of its operands. English nullCoalescingExpressionUpperDerivation If a name has the same assigned source after the second operand expression of a null-coalescing expression as before it, that is its assigned source after the null-coalescing expression. Otherwise, its assigned source after the null-coalescing expression is the null-coalescing expression. If a name is unassigned before the second operand expression but assigned after it, then it has a multiplicity lower bound of 0 after the null-coalescing expression. * result public return updateAssignments public The minimum lower bound of an operand of a null-coalescing expression is 0. result public return minLowerBound public The maximum upper bound of an operand of a null-coalescing expression is * (unbounded). result public return maxUpperBound public NullCoalescingExpression A list of type names used to provide arguments for the parameters of a template. TemplateBinding true A unary expression with either an increment or decrement operator. If the operand of an increment or decrement expression is a name, then the assignment for the expression is a new assigned source for the name with the expression as the source. English incrementOrDecrementExpressionAssignmentDerivation An increment or decrement expression has a feature as its operand if the operand is a feature left-hand side or a name left-hand side for a name that disambiguates to a feature. English incrementOrDecrementExpressionIsFeatureDerivation An increment or decrement expression is indexed if its operand is indexed. English incrementOrDecrementExpressionIsIndexedDerivation An increment or decrement expression is a data value update if its operand is an attribute of a data value held in a local name or parameter. English incrementOrDecrementExpressionIsDataValueUpdateDerivation If the operand of an increment or decrement expression is a feature, then the referent for the operand. English incrementOrDecrementExpressionFeatureDerivation The effective expression for the operand of an increment or decrement expression is the operand treated as a name expression, property access expression or sequence access expression, as appropriate for evaluation to obtain the original value to be updated. English incrementOrDecrementExpressionExpressionDerivation If the operand of an increment or decrement expression is of a type that conforms to type Integer or Real, then the type of the expression is Integer or Real, respectively. Otherwise the expression has no type. English incrementOrDecrementExpressionTypeDerivation An increment or decrement expression has the same multiplicity lower bound as its operand expression. English incrementOrDecrementExpressionLowerDerivation An increment or decrement expression has a multiplicity upper bound of 1. English incrementOrDecrementExpressionUpperDerivation The operand expression must have a type that conforms to type Integer or Real and a multiplicity upper bound of 1. English incrementOrDecrementExpressionOperand The assignments before the operand of an increment or decrement expression are the same as those before the increment or decrement expression. English incrementOrDecrementExpressionAssignmentsBefore If the operand is a name, then the new assigned source for that name. assignment public true The operand, which must have the form of an assignment left-hand side. operand public composite The effective expression used to obtain the original value of the operand to be updated. expression public true If the operand is a feature, then the referent for that feature. feature public true Whether the operator is being used as a prefix or a postfix. isPrefix public The operator for this increment or decrement expression, either "++" for increment or "--" for decrement. operator public Whether the operand is a feature or not. isFeature public true If the operand is a feature, whether it has an index or not. isIndexed public true Whether this expression updates an attribute of a data value held in a local name or parameter. isDataValueUpdate public true The assignments after an increment and decrement expression include all those after its operand expression. Further, if the operand expression, considered as a left hand side, is a local name, then this is reassigned. * result public return updateAssignments public IncrementOrDecrementExpression An expression consisting of an operator acting on two operand expressions. The operands of a binary expression must both have a multiplicity lower bound no less than that given by the minLowerBound helper operation. The operands of a binary expression must both have a multiplicity upper bound no greater than that given by the maxUpperBound helper operation. English binaryExpressionOperandMultiplicity The assignments in the operand expressions of a binary expression must be valid (as determined by the validateAssignments helper operation). English binaryExpressionOperandAssignments The expression giving the first operand. operand1 public composite The expression giving the second operand. operand2 public composite The symbol representing the operator. operator public In general the assignments before the operand expressions of a binary expression are the same as those before the binary expression and, if an assignment for a name is changed in one operand expression, then the assignment for that name may not change in the other operand expression. (This is overridden for conditional logical expressions.) result public return validateAssignments public The assignments after a binary expression include all the assignments before the expression that are not reassigned in either operand expression, plus the new assignments from each of the operand expressions. * result public return updateAssignments public By default, the minimum allowed lower bound for an operand of a binary expression is 1. result public return minLowerBound public By default, the maximum allowed upper bound for an operand of a binary expression is 1. result public return maxUpperBound public BinaryExpression true An expression used to carry out one of a predefined set of operations over each of the elements in a sequence. The assigned source for the expansion variable of a sequence expansion expression is the expression itself. The type for the assignment is the type of the primary expression of the sequence expansion expression and the multiplicity lower and upper bounds are 1. English sequenceExpansionExpressionVariableSourceDerivation The assignments before the primary expression of a sequence expansion expression are the same as the assignments before the sequence expansion expression. English sequenceExpansionExpressionAssignmentsBeforePrimary The assignments before the argument expression of a sequence expansion expression include those after the primary expression plus one for the expansion variable. English sequenceExpansionExpressionAssignmentsBeforeArgument The expansion variable name may not conflict with any name already assigned after the primary expression. sequenceExpansionExpressionVariableName The assignments after the argument expression of a sequence expansion expression must be the same as the assignments before the argument expression. English sequenceExpansionExpressionAssignmentsAfterArgument The name of the operation to be carried out. operation public The name of the expansion variable available as a local name within the argument expression. variable public The assigned source for the expansion variable within the argument expression. The source is actually the sequence expansion expression itself. variableSource public true The argument expression. The exact form required for this expression depends on which expansion operation is being carried out. argument public composite The class name or primary expression that evaluates to the sequence to be acted on. primary public composite The assignments after a sequence expansion expression are the same as after its primary expression. * result public return updateAssignments public SequenceExpansionExpression true An expression used to create a new instance of a class or data type. An instance creation expression is an object creation if its referent is not a data type. English instanceCreationExpressionIsObjectCreationDerivation An instance creation expression is constructorless if its referent is a class. English instanceCreationExpressionIsConstructorlessDerivation The referent of an instance creation expression is normally the constructor operation, class or data type to which the constructor name resolves. However, if the referent is an operation whose class is abstract or is a class that is itself abstract, and there is an associated Impl class constructor, then the referent is the Impl class constructor. Further, if the constructor name of an instance creation expression is empty, then the referent must be determined from the context of use of the expression. English instanceCreationExpressionReferentDerivation There is no feature for an instance creation expression. English instanceCreationExpressionFeatureDerivation The constructor name must resolve to a constructor operation (that is compatible with the tuple argument expressions), a class or a data type, but not both a class and a data type. English instanceCreationExpressionConstructor If the expression is constructorless, then its tuple must be empty and the referent class must not have any owned operations that are constructors. English instanceCreationExpressionConstructorlessLegality If an instance creation expression is a data value creation (not an object creation), then the tuple argument expressions are matched with the attributes of the named type. English instanceCreationExpressionDataTypeCompatibility If the referent of an instance creation expression is an operation, then the class of that operation must not be abstract. Otherwise, the referent is a class or data type, which must not be abstract. English instanceCreationExpressionReferent Whether this is a constructorless object creation expression. isConstructorless public true Whether this is an object creation expression or a data value creation expression. isObjectCreation public true The name of the class constructor operation to be invoked or the name of a class or data type. constructor public composite Returns the parameters of a constructor operation or the attributes of a data type, or an empty set for a constructorless instance creation. * result public return parameterElements public InstanceCreationExpression * expression public A_assignmentBefore_expression qualifiedName public A_nameBinding_qualifiedName assignmentExpression public A_expression_assignmentExpression extentOrExpression public A_expression_extentOrExpression classificationExpression public A_referent_classificationExpression sequenceReductionExpression public A_referent_sequenceReductionExpression conditionalTestExpression public A_operand1_conditionalTestExpression sequenceConstructionExpression public A_elements_sequenceConstructionExpression sequenceRange public A_rangeUpper_sequenceRange behaviorInvocationExpression public A_target_behaviorInvocationExpression sequenceExpansionExpression public A_argument_sequenceExpansionExpression * incrementOrDecrementExpression public A_expression_incrementOrDecrementExpression sequenceAccessExpression public A_index_sequenceAccessExpression propertyAccessExpression public A_featureReference_propertyAccessExpression extentOrExpression public A_nonNameExpression_extentOrExpression sequenceOperationExpression public A_leftHandSide_sequenceOperationExpression sequenceRange public A_rangeLower_sequenceRange qualifiedName public A_qualification_qualifiedName castExpression public A_operand_castExpression * invocationExpression public A_referent_invocationExpression binaryExpression public A_binaryExpression_operand1 featureReference public A_expression_featureReference nameExpression public A_propertyAccess_nameExpression superInvocationExpression public A_target_superInvocationExpression unaryExpression public A_operand_unaryExpression namedTemplateBinding public A_substitution_namedTemplateBinding * nameExpression public A_enumerationLiteral_nameExpression sequenceExpansionList public A_element_SequenceExpansionList castExpression public A_typeName_castExpression conditionalTestExpression public A_operand3_conditionalTestExpression * invocationExpression public A_feature_invocationExpression conditionalTestExpression public A_operand2_conditionalTestExpression positionalTemplateBinding public A_argumentName_positionalTemplateBinding A_tuple_invocation * nameExpression public A_assignment_nameExpression qualifiedName public A_disambiguation_qualifiedName namedExpression public A_expression_namedExpression outputNamedExpression public A_leftHandSide_outputNamedExpression assignmentExpression public A_rightHandSide_assignmentExpression sequenceAccessExpression public A_primary_sequenceAccessExpression * qualifiedName public A_referent_qualifiedName sequenceOperationExpression public A_primary_sequenceOperationExpression nameBinding public A_binding_nameBinding classExtentExpression public A_className_classExtentExpression * incrementOrDecrementExpression public A_feature_incrementOrDecrementExpression linkOperationExpression public A_associationName_linkOperationExpression binaryExpression public A_binaryExpression_operand2 invocationExpression public A_boundReferent_invocationExpression sequenceConstructionExpression public A_typeName_sequenceConstructionExpression featureReference public A_nameBinding_featureReference sequenceReductionExpression public A_behaviorName_sequenceReductionExpression * featureReference public A_referent_featureReference positionalTuple public A_expression_positionalTuple sequenceOperationExpression public A_operation_sequenceOperationExpression * propertyAccessExpression public A_feature_propertyAccessExpression namedExpression public A_index_namedExpression templateParameterSubstitution public A_argumentName_templateParameterSubstitution * assignmentExpression public A_feature_assignmentExpression * leftHandSide public A_assignmentBefore_leftHandSide * sequenceExpansionExpression public A_variableSource_sequenceExpansionExpression featureLeftHandSide public A_feature_featureLeftHandSide * leftHandSide public A_assignmentAfter_leftHandSide * expression public A_assignmentAfter_expression * invocationExpression public A_parameter_invocationExpression sequenceExpansionExpression public A_primary_sequenceExpansionExpression qualifiedName public A_templateName_qualifiedName namedTuple public A_namedExpression_namedTuple leftHandSide public A_index_leftHandSide featureInvocationExpression public A_target_featureInvocationExpression instanceCreationExpression public A_constructor_instanceCreationExpression classificationExpression public A_typeName_classificationExpression tuple public A_input_tuple tuple public A_output_tuple incrementOrDecrementExpression public A_operand_incrementOrDecrementExpression nameExpression public A_name_nameExpression nameLeftHandSide public A_target_nameLeftHandSide * qualifiedName public A_qualifiedName_unqualifiedName * incrementOrDecrementExpression public A_assignment_incrementOrDecrementExpression extentOrExpression public A_name_extentOrExpression * expression public A_type_expression * assignmentExpression public A_assignment_assignmentExpression sequenceReductionExpression public A_primary_sequenceReductionExpression assignmentExpression public A_leftHandSide_assignmentExpression A looping statement for which the continuation condition is first tested after the first iteration. The assignments before the block of a do statement are the same as the assignments before the do statement, except that any local names with a multiplicity lower bound of 0 after the condition expression are adjusted to also have a multiplicity lower bound of 0 before the block. The assignments before the condition expression of a do statement are the same assignments after the block. English doStatementAssignmentsBefore If the assigned source for a name after the condition expression is different than before the do statement, then the assigned source of the name after the do statement is the do statement. Otherwise it is the same as before the do statement. The assignments after the do statement are adjusted for known null and non-null names and type classifications due to the condition expression being false. English doStatementAssignmentsAfter The condition expression of a do statement must have a type that conforms to type Boolean and multplicity [1..1]. English doStatementCondition The enclosing statement for all statements in the body of a do statement are the do statement. English doStatementEnclosedStatements The expression to be evaluated to determine whether to continue looping. condition public composite The sequence of statements to be iteratively executed. body public composite DoStatement A model of an Alf statement. All the annotations of a statement must be allowed, as given by the annotationAllowed operation for the statement. English statementAnnotationsAllowed No name may be assigned more than once before or after a statement. English statementUniqueAssignments A statement is isolated if it has an @isolated annotation. English statementIsIsolatedDerivation A statement has indexing from 0 if it has an @indexFrom0 annotation, or it is contained in a statement with indexing from 0 and it does not have an @indexFrom1 annotation applied. English statementIsIndexFrom0Derivation The annotations applied to this statement. * annotation public composite The assigned sources for local names available lexically before this statement. * assignmentBefore public true The assigned sources for local names available lexically after this statement. This includes not only any assignments made within the statement, but also any assignments that are unchanged from before the statement. * assignmentAfter public true The statement immediately enclosing this statement, if any. enclosingStatement public true Whether this statement should be executed in isolation. isIsolated public true Whether indexing should be from 0 within the statement. isIndexFrom0 public true Returns true if the given annotation is allowed for this kind of statement. By default, only @isolated, @indexFrom0 and @indexFrom1 annotations are allowed, with no arguments. This operation is redefined only in subclasses of Statement for kinds of statements that allow different annotations than this default. annotation public result public return annotationAllowed public Returns true if this statement is assured to generate a return value. By default, a statement does not have a return value. result public return hasReturnValue public Statement true A statement that executes a block. In a parallel block statement, any name assigned in one statement of the block may not be further assigned in any subsequent statement in the same block. English blockStatementParallelAssignments The assignments before the block of a block statement are the same as the assignments before the block statement. English blockStatementAssignmentsBefore The assignments after a block statement are the same as the assignments after the block of the block statement. English blockStatementAssignmentsAfter The enclosing statement for all the statements in the block of a block statement is the block statement. English blockStatementEnclosedStatements A block statement is parallel if it has a @parallel annotation. English blockStatementIsParallelDerivation The block to be executed. block public composite Whether the statements in the block of this block statement should be executed concurrently. isParallel public true In addition to an @isolated annotation, a block statement may have a @parallel annotation. It may not have any arguments. annotation public result public return annotationAllowed public A block statement has a return value if its block has a return value. result public return hasReturnValue public BlockStatement A statement that changes the classification of an object. The expression in a classify statement must have a class as its type and multiplicity upper bound of 1. English classifyStatementExpression All qualified names listed in the from or to lists of a classify statement must resolve to classes. English classifyStatementClassNames All the from and to classes of a classify statement must be subclasses of the declared type of the target expression and none of them may have a common superclass that is a subclass of the declared type of the target expression (that is, they must be disjoint subclasses). English classifyStatementClasses The assignments before the expression of a classify statement are the same as the assignments before the statement. English classifyStatementAssignmentsBefore The assignments after a classify statement are the same as the assignments after its expression. English classifyStatementAssignmentsAfter The from classes of a classify statement are the class referents of the qualified names in the from list for the statement. English classifyStatementFromClassDerivation The to classes of a classify statement are the class referents of the qualified names in the to list for the statement. English classifyStatementToClassDerivation The expression to be evaluated to obtain the object to be reclassified. expression public composite A list of names of classes to be removed as types of the object. fromList public composite A list of names of classes to be added as types of the object. toList public composite The classes denoted by the names in the from list. * fromClass public true The classes denoted by the names in the to list. * toClass public true Whether this classify statement reclassifies all types of the target object. isReclassifyAll public ClassifyStatement A grouping of non-final conditional clauses to be tested concurrently. The assignments before the condition of each of the clauses in a set of concurrent clauses are the same as the assignments before the concurrent clauses. English concurrentClausesAssignmentsBefore The same name may not be assigned in more than one conditional expression within the same concurrent set of clauses. English concurrentClausesConditionAssignments The conditional clauses in the group. * clause public composite The assigned sources for local names available lexically before this group of conditional clauses. * assignmentBefore public true ConcurrentClauses A statement that has no affect when executed. The assignments after and empty statement are the same as the assignments before the statement. English emptyStatementAssignmentsAfter An empty statement may not have any annotations. annotation public result public return annotationAllowed public EmptyStatement A block of an accept statement that accepts one or more signals. The signals of an accept block are the referents of the signal names of the accept block. English acceptBlockSignalDerivation All signal names in an accept block must resolve to signals. English acceptBlockSignalNames The local name to which an accepted signal instance will be assigned. name public The body of the accept block, executed if one of the named signals is received. block public composite A list of names of the signals accepted by this accept block. signalNames public composite The signals denoted by the signal names of the accept block. * signal public true AcceptBlock A statement that causes the termination of execution of an immediately enclosing block. The target of a break statement is the innermost switch, while, do or for statement enclosing the break statement. English breakStatementTargetDerivation The target of a break statement may not have a @parallel annotation. English breakStatementNonparallelTarget The enclosing statement that is terminated by this break statement. target public true A break statement may not have any annotations. annotation public result public return annotationAllowed public BreakStatement The definition of a loop variable in a for statement. The assignments after a loop variable definition include the assignments after the expression (or expressions) of the definition plus a new assigned source for the loop variable itself. The assigned source for the loop variable is the loop variable definition. The multiplicity upper bound for the variable is 1. The multiplicity lower bound is 1 if the loop variable definition is the first in a for statement and 0 otherwise. If collection conversion is not required, then the variable has the inferred or declared type from the definition. If collection conversion is required, then the variable has the sequence type of the collection class. English loopVariableDefinitionAssignmentAfterDerivation The assignments before the expressions of a loop variable definition are the assignments before the loop variable definition. English loopVariableDefinitionAssignmentsBefore If a loop variable definition has two expressions, then both expressions must have a type that conforms to type Integer and a multiplicity upper bound of 1, and no name may be newly assigned or reassigned in more than one of the expressions. English loopVariableDefinitionRangeExpressions If a loop variable definition has a type name, then this name must resolve to a non-template classifier. English loopVariableDefinitionTypeName If the type of a loop variable is not inferred, then the variable has the type denoted by the type name, if it is not empty, and is untyped otherwise. If the type is inferred, them the variable has the same as the type of the expression in its definition. English loopVariableDefinitionTypeDerivation If the type of a loop variable definition is not inferred, then the first expression of the definition must have a type that conforms to the declared type. English loopVariableDefinitionDeclaredType Collection conversion is required for a loop variable definition if the type for the definition is a collection class and the multiplicity upper bound of the first expression is no greater than 1. English loopVariableDefinitionIsCollectionConversionDerivation The variable name given in a loop variable definition must be unassigned after the expression or expressions in the definition. English loopVariableDefinitionVariable The name of the loop variable. variable public If there is only one expression, then this expression is evaluated to produce a sequence of values to be assigned to the loop variable on successive iterations. Otherwise it is evaluated to provide the first value of a range of values to be assigned to the loop variable. expression1 public composite The expression to be evaluated to give the second value in a range of values to be assigned to the loop variable. expression2 public composite The declared type of the loop variable. typeName public composite Whether the type of the variable is inferred or declared explicitly. NOTE: This flag is necessary to because a variable that is explicitly declared to have type "any" will have an empty typeName, just like a variable whose type is to be inferred, but, in the former case, the type is actually intended to be empty, not inferred. true typeIsInferred public Whether collection conversion is required. isCollectionConversion public true The declared or inferred type of the loop variable. type public true Whether this definition is the first in the list of definitions in the enclosing for statement. isFirst public true The assigned sources for local names available lexically before this loop variable definition. * assignmentBefore public true The assigned sources for local names available lexically after this loop variable definition. This includes not only any assignments made within the statement, but also any assignments that are unchanged from before the statement. * assignmentAfter public true LoopVariableDefinition A clause in a switch statement with a set of cases and a sequence of statements that may be executed if one of the cases matches the switch value. The assignments before any case expression of a switch clause are the same as the assignments before the clause. The assignments before the block of a switch clause are the assignments after all case expressions. English switchClauseAssignmentsBefore If a name is unassigned before a switch clause, then it must be unassigned after all case expressions of the clause (i.e., new local names may not be defined in case expressions). English switchClauseCaseLocalNames All the case expressions of a switch clause must have a multiplicity no greater than 1. English switchClauseCases The expressions to be evaluated to provide values to test against the switch value. * case public composite The sequence of statements that may be executed if one of the cases matches the switch value. block public composite The assignments before a switch clause are the assignments before any case expression of the clause. * result public return assignmentsBefore public The assignments after a switch clause are the assignments after the block of the switch clause. * result public return assignmentsAfter public SwitchClause A looping statement that gives successive values to one or more loop variables on each iteration. The assignments before a loop variable definition in a for statement are the same as before the for statement. The assignments before the body of the statement include all the assignments before the statement plus any new assignments from the loop variable definitions, except that, if the statement is parallel, the assigned sources of any names given in @parallel annotations are changed to be the for statement itself. English forStatementAssignmentsBefore The loop variables are unassigned after a for statement. Other than the loop variables, if the assigned source for a name after the body of a for statement is the same as after the for variable definitions, then the assigned source for the name after the for statement is the same as after the for variable definitions. If name has a different assigned source after the body of the for statement than after the for variable definitions, then the assigned source after the for statement is the for statement itself. English forStatementAssignmentsAfter A @parallel annotation of a for statement may include a list of names. Each such name must be already assigned after the loop variable definitions of the for statement, with a multiplicity upper bound other than 1. These names may only be used within the body of the for statement as the first argument for the CollectionFunctions::add behavior. English forStatementParallelAnnotationNames If, after the loop variable definitions of a parallel for statement, a name has an assigned source, then it must have the same assigned source after the block of the for statement. Other than for names defined in the @parallel annotation of the for statement, the assigned source for such names is the same after the for statement as before it. Any names defined in the @parallel annotation have the for statement itself as their assigned source after the for statement. Other than names given in the @parallel annotation, if a name is unassigned after the loop variable definitions, then it is considered unassigned after the for statement, even if it is assigned in the block of the for statement. English forStatementParallelAssignmentsAfter The isFirst attribute of the first loop variable definition for a for statement is true while the isFirst attribute if false for any other definitions. English forStatementVariableDefinitions The assigned sources for loop variables after the body of a for statement must be the for statement (the same as before the body). English forStatementLoopVariables A for statement is parallel if it has a @parallel annotation. English forStatementIsParallelDerivation The enclosing statement for all statements in the body of a for statement are the for statement. English forStatementEnclosedStatements The sequence of statements to be iteratively executed. body public composite A list of definitions of one or more loop variables. * variableDefinition public true composite Whether the for statement is parallel. isParallel public true In addition to an @isolated annotation, a for statement may have a @parallel annotation. annotation public result public return annotationAllowed public ForStatement A conditional statement that executes (at most) one of a set of clauses based on boolean conditions. The assignments before each non-final clause of an if statement are the same as the assignments before the if statement, adjusted for known nulls and non-nulls and type classifications due to the failure of the conditions in all previous sets of concurrent clauses. If the statement has a final clause, then the assignments before that clause are also the same as the assignments before the if statement, adjusted for the failure of the conditions of all previous clauses. English ifStatementAssignmentsBefore Any name that is unassigned before an if statement and is assigned in one or more clauses of the if statement, has, after the if statement, a type that is is the effective common ancestor of the types of the name in each clause in which it is defined. For a name that has an assigned source after any clause of an if statement that is different than before that clause, then the assigned source after the if statement is the if statement, with a multiplicity lower bound that is the minimum of the lower bound for the name in each clause and a multiplicity upper bound that is the maximum for the name in each clause (where the name is considered to have multiplicity [0..0] for clauses in which it is not defined and unchanged multiplicity for an implicit final clause, unless the if statement is assured). Otherwise, the assigned source of a name after the if statement is the same as before the if statement. English ifStatementAssignmentsAfter The enclosing statement of all the statements in the bodies of all non-final clauses and in the final clause (if any) of an if statement is the if statement. English ifStatementEnclosedStatements An if statement is assured if it has an @assured annotation. English ifStatementIsAssuredDerivation An if statement is determinate if it has an @determinate annotation. English ifStatementIsDeterminateDerivation A list of groupings of concurrent clauses that are to be checked sequentially for a successful condition. * nonFinalClauses public true composite A sequence of statements to be executed if no other clause has a successful condition. finalClause public composite Whether at least one condition in the if statement is assured to evaluate to true. isAssured public true Whether at most one condition in the if statement will ever to evaluate to true. isDeterminate public true In addition to an @isolated annotation, an if statement may have @assured and @determinate annotations. They may not have arguments. annotation public result public return annotationAllowed public An if statement has a return value if the bodies of all its clauses have return values, and it either has a final clause or is assured. result public return hasReturnValue public IfStatement A clause of an if statement with a conditional expression and a sequence of statements that may be executed if the condition is true. The assignments before the body of a non-final clause are the assignments after the condition, adjusted for known null and non-null names and type classifications due to the condition being true. English nonFinalClauseAssignmentsBeforeBody If a name is unassigned before the condition expression of a non-final clause, then it must be unassigned after that expression (i.e., new local names may not be defined in the condition). English nonFinalClauseConditionLocalNames The condition of a non-final clause must have a type that conforms to type Boolean and multiplicity [1..1]. English nonFinalClauseConditionType The expression that is evaluated to determine whether the clause body may be executed. condition public composite The sequence of statements that may be executed if the condition evaluates to true. body public composite The assignments before a non-final clause are the assignments before the condition of the clause. * result public return assignmentsBefore public The assignments after a non-final clause are the assignments after the block of the clause. * result public return assignmentsAfter public NonFinalClause A statement used to accept the receipt of instances of one or more signals. An accept statement can only be used within the definition of an active behavior or the classifier behavior of an active class. English acceptStatementContext The containing behavior of an accept statement must have receptions for all signals from all accept blocks of the accept statement. No signal may be referenced in more than one accept block of an accept statement. English acceptStatementSignals Any name defined in an accept block of an accept statement must be unassigned before the accept statement. English acceptStatementNames A local name specified in the accept block of a simple accept statement has the accept statement as its assigned source after the accept statement. The type of the local name is the effective common ancestor of the specified signals, if one exists, and it is untyped otherwise. English acceptStatementSimpleAcceptLocalName For a compound accept statement, a local name defined in an accept block has the accept block as its assigned source before the block associated with the accept block. The type of the local name is the effective common ancestor of the specified signals for that accept clause, if one exists, and it is untyped otherwise. However, the local name is considered unassigned after the accept statement. English acceptStatementCompoundAcceptLocalName The assignments before any block of an accept statement are the assignments before the accept statement. English acceptStatementAssignmentsBefore If a name is assigned in any block of an accept statement, then the assigned source of the name after the accept statement is the accept statement itself. English acceptStatementAssignmentsAfter Any name that is unassigned before an accept statement and is assigned in one or more blocks of the accept statement, has, after the accept statement, a type that is is the effective common ancestor of the types of the name in each block in which it is defined, with a multiplicity lower bound that is the minimum of the lower bound for the name in each block (where it is considered to have multiplicity lower bound of zero for blocks in which it is not defined), and a multiplicity upper bound that is the maximum for the name in each block in which it is defined. English acceptStatementNewAssignments An accept statement is simple if it has exactly one accept block and that accept block does not have a block. English acceptStatementIsSimpleDerivation The enclosing statement for all statements in the blocks of all accept blocks of an accept statement is the accept statement. English acceptStatementEnclosedStatements One or more blocks for accepting alternate groups of signals. * acceptBlock public composite The behavior containing the accept statement. behavior public true Whether the accept statement is simple or not. isSimple public true An accept statement has a return value if all of its accept clauses have return values. result public return hasReturnValue public AcceptStatement A statement that executes code in a language other than Alf. The assignments after an in-line statement are the same as the assignments before the statement. English inLineStatementAssignmentsAfter The name of the language in which the code is written. language public The in-line code to be executed. code public InLineStatement A statement that declares the type of a local name and assigns it an initial value. The assignments before the expression of a local name declaration statement are the same as the assignments before the statement. English localNameDeclarationStatementAssignmentsBefore If the type name in a local name declaration statement is not empty, then it must resolve to a non-template classifier and the expression must be assignable to that classifier. English localNameDeclarationStatementType The local name in a local name declaration statement must be unassigned before the statement and before the expression in the statement. It must remain unassigned after the expression. English localNameDeclarationStatementLocalName The assignments after a local name declaration statement are the assignments after the expression of the statement plus a new assignment for the local name defined by the statement. The assigned source for the local name is the local name declaration statement. The local name has the type denoted by the type name if this is not empty and is untyped otherwise. The multiplicity lower bound of the local name is 0 if the expression has a lower bound of 0, otherwise it is 1. If the statement has multiplicity, then the multiplicity upper bound of the local name is *, otherwise it is 1. English localNameDeclarationStatementAssignmentsAfter If a local name declaration statement does not have multiplicity, then the multiplicity of upper bound of the assigned expression must not be greater than 1. English localNameDeclarationStatementExpressionMultiplicity The type of a local name declaration statement with a type name is the single classifier referent of the type name. Otherwise the type is empty. English localNameDeclarationStatementTypeDerivation If the expression of a local name declaration statement is an instance creation expression with no constructor, and the type of the statement is a class or (structured) data type, then the referent of the expression is the type of the statement. If the expression of a local name declaration statement is a sequence construction expression with no type name, but with non-empty elements, then the type of the expression is the type of the statement and the expression has multiplicity if and only if the statement does. English localNameDeclarationStatementExpressionType The local name being declared. name public The expression to be evaluated to provide the initial value to be assigned to the local name. expression public composite Whether the local name is to have a multiplicity upper bound of * rather than 1. hasMultiplicity public The declared type of the local name. typeName public composite The type declared for the given local name. type public true LocalNameDeclarationStatement An identified modification to the behavior of an annotated statement. The name of the annotation. identifier public If permitted by the annotation, an optional list of local names relevant to the annotation. * argument public Annotation A grouped sequence of statements. The assignments before each statement in a block other than the first are the same as the assignments after the previous statement. English blockAssignmentsBeforeStatements The assignments before the first statement of a block are the same as the assignments before the block. English blockAssignmentsBefore If a block is not empty, then the assignments after the block are the same as the assignments after the last statement of the block. Otherwise they are the same as the assignments before the block. English blockAssignmentAfterDerivation The ordered sequence of statements in the block. * statement public true composite The assigned sources for local names available lexically after this block. This includes not only any assignments made within the block, but also any assignments that are unchanged from before the block. * assignmentAfter public true The assigned sources for local names available lexically before this block. * assignmentBefore public true A block has a return value if any of its statements has a return value. result public return hasReturnValue public Block A statement that evaluates an expression when executed. The assignments before the expression of an expression statement are the same as the assignments before the statement. English expressionStatementAssignmentsBefore The assignments after an expression statement are the same as the assignments after its expression. English expressionStatementAssignmentsAfter The expression to be evaluated. expression public composite ExpressionStatement A statement that provides a value for the return parameter of an activity. If the behavior containing the return statement has a return parameter, then the return statement must have an expression, and the expression must be assignable to that return parameter. English returnStatementContext The assignments before the expression of a return statement are the same as the assignments before the statement. English returnStatementAssignmentsBefore The assignments after a return statement are the same as the assignments after the expression of the return statement. English returnStatementAssignmentsAfter The expression to be evaluated to provide the returned value. expression public composite A reference to the enclosing behavior for this return statement. behavior public true A return statement is considered to have a return value. result public return hasReturnValue public ReturnStatement A statement that executes (at most) one of a set of statement sequences based on matching a switch value to a set of test cases. The assignments before the case expressions of all clauses of a switch statement are the same as the assignments after the expression of the switch statement. English switchStatementAssignmentsBefore The same local name may not be assigned in more than one case expression in a switch statement. English switchStatementCaseAssignments If a name has an assigned source after any clause of a switch statement that is different than before that clause (including newly defined names), the assigned source after the switch statement is the switch statement, with a multiplicity lower bound that is the minimum of the lower bound for the name in each clause and a multiplicity upper bound that is the maximum for the name in each clause (where the name is considered to have multiplicity [0..0] for clauses in which it is not defined and unchanged multiplicity for an implicit default clause, unless the switch statement is assured). Otherwise, the assigned source of a name after the switch statement is the same as before the switch statement. English switchStatementAssignmentsAfter Any name that is unassigned before a switch statement and is assigned in one or more clauses of the switch statement, has, after the switch statement, a type that is is the effective common ancestor of the types of the name in each clause in which it is defined. English switchStatementAssignments A switch statement expression must have a multiplicity no greater than 1. English switchStatementExpression A switch statement is the enclosing statement for the statements in all of its switch clauses. English switchStatementEnclosedStatements A switch statement is determinate if it has a @determinate annotation. English switchStatementIsDeterminateDerivation A switch statement is assured if it has an @assured annotation. English switchStatementIsAssuredDerivation The set of switch clauses whose cases are to be tested against the switch value. * nonDefaultClause public composite The expression to be evaluated to provide the switch value. expression public composite A sequence of statements to be executed if no switch clause case matches the switch value. defaultClause public composite Whether at least one case in the switch statement is assured to match. isAssured public true Whether at most one case in the if statement will ever to match. isDeterminate public true In addition to an @isolated annotation, a switch statement may have @assured and @determinate annotations. They may not have arguments. annotation public result public return annotationAllowed public A switch statement has a return value if the blocks of all its clauses have return values, and it either has a default clause or is assured. result public return hasReturnValue public SwitchStatement A group of qualified names. The names in the group. * name public composite QualifiedNameList A looping statement for which the continuation condition is first tested before the first iteration. The assignments before the condition expression of a while statement are the same as the assignments before the while statement, except that any local names with a multiplicity lower bound of 0 after the block are adjusted to also have a multiplicity lower bound of 0 before the condition expression. The assignments before the block of the while statement are the same as the assignments after the condition expression, adjusted for known null and non-null names and type classifications due to the condition expression being true. English whileStatementAssignmentsBefore If the assigned source for a name after the block of a while statement is different than before the while statement, then the assigned source of the name after the while statement is the while statement. Otherwise it is the same as before the while statement. If a name is unassigned before the block of a while statement and assigned after the block, then it has multiplicity lower bound of 0 after the while statement. Otherwise, the assignments after the while statement are adjusted for known null and non-null names and type classifications due to the condition expression being false. English whileStatementAssignmentsAfter The condition expression of a while statement must have a type that conforms to type Boolean and multiplicity [1..1]. English whileStatementCondition The enclosing statement for all statements in the body of a while statement are the while statement. English whileStatementEnclosedStatements The sequence of statements to be iteratively executed. body public composite The expression to be evaluated to determine whether to continue looping. condition public composite WhileStatement doStatement public A_body_doStatement returnStatement public A_expression_returnStatement * statement public A_enclosingStatement_statement * loopVariableDefinition public A_type_loopVariableDefinition * concurrentClauses public A_assignmentBefore_concurrentClauses qualifiedNameList public A_name_qualifiedNameList ifStatement public A_nonFinalClauses_ifStatement * block public A_assignmentAfter_block doStatement public A_condition_doStatement switchClause public A_case_switchClause * breakStatement public A_target_breakStatement classifyStatement public A_expression_classifyStatement * loopVariableDefinition public A_assignmentBefore_loopVariableDefinition loopVariableDefinition public A_expression2_loopVariableDefinition nonFinalClause public A_body_nonFinalClause acceptBlock public A_signal_acceptBlock acceptBlock public A_block_acceptBlock block public A_statement_block classifyStatement public A_fromList_classifyStatement acceptBlock public A_signalNames_acceptBlock * acceptStatement public A_behavior_acceptStatement nonFinalClause public A_condition_nonFinalClause concurrentClauses public A_clause_concurrentClauses blockStatement public A_block_blockStatement * returnStatement public A_behavior_returnStatement * statement public A_assignmentBefore_statement switchClause public A_block_switchClause localNameDeclarationStatement public A_expression_localNameDeclarationStatement expressionStatement public A_expression_expressionStatement * statement public A_assignmentAfter_statement * loopVariableDefinition public A_assignmentAfter_loopVariableDefinition acceptStatement public A_acceptBlock_acceptStatement loopVariableDefinition public A_typeName_loopVariableDefinition ifStatement public A_finalClause_ifStatement whileStatement public A_condition_whileStatement * classifyStatement public A_fromClass_classifyStatement loopVariableDefinition public A_expression1_loopVariableDefinition whileStatement public A_body_whileStatement statement public A_annotation_statement switchStatement public A_expression_switchStatement * classifyStatement public A_toClass_classifyStatement forStatement public A_variableDefinition_forStatement * block public A_assignmentBefore_block localNameDeclarationStateament public A_type_localNameDeclarationStatement switchStatement public A_defaultClause_switchStatement switchStatement public A_nonDefaultClause_switchStatement forStatement public A_body_forStatement classifyStatement public A_toList_classifyStatement localNameDeclarationStatement public A_typeName_localNameDeclarationStatement A typed element definition for a property (attribute or association end). If a property definition has an initializer, then the initializer expression must be assignable to the property definition. There are no assignments before an initializer expression. English propertyDefinitionInitializer A property definition requires collection conversion if its initializer has a collection class as its type and the property definition does not. English propertyDefinitionIsCollectionConversionDerivation A property definition requires BitString conversion if its type is BitString and the type of its initializer is Integer or a collection class whose sequence type is Integer. English propertyDefinitionIsBitStringConversionDerivation A property definition is a feature. English propertyDefinitionIsFeatureDerivation If the initializer of a property definition is an instance creation expression with no constructor, and the type of the property definition is a class or (structured) data type, then the referent of the expression is the type of the property definition. If the initializer of a property definition is a sequence construction expression with no type name, but with non-empty elements, then the type of the expression is the type of the property definition and the expression has multiplicity if and only if the multiplicity upper bound of the property definition is greater than 1. English propertyDefinitionInitializerType Whether the property being defined has composite aggregation. isComposite public The expression to be evaluated to initialize the property. initializer public composite Whether collection conversion is required for the initialization of this property. isCollectionConversion public true Whether BitString conversion is required for the initialization of this property. isBitStringConversion public true Returns true if the annotation is for a stereotype that has a metaclass consistent with Property. annotation public result public return annotationAllowed public Return true if the given member is either a PropertyDefinition or an imported member whose referent is a PropertyDefinition or a Property. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public PropertyDefinition An annotation of a member definition indicating the application of a stereotype (or one of a small number of special-case annotations). Unless the stereotype name is "apply", "primitive" or "external" then the stereotype for a stereotype annotation is the stereotype denoted by the stereotype name. English stereotypeAnnotationStereotypeDerivation The stereotype name of a stereotype annotation must either be one of "apply", "primitive" or "external", or it must denote a single stereotype from a profile applied to an enclosing package. The stereotype name does not need to be qualified if there is only one applied profile with a stereotype of that name or if the there is a standard UML profile with the name. English stereotypeAnnotationStereotypeName If the stereotype name of a stereotype annotation is "apply", then it must have a name list and all of the names in the list must resolve to profiles. English stereotypeAnnotationApply If the stereotype name of a stereotype annotation is "primitive", then it may not have tagged values or names. English stereotypeAnnotationPrimitive If the stereotype name of a stereotype annotation is "external", then it may optionally have a single tagged value with the name "file" and no operator. English stereotypeAnnotationExternal If a stereotype annotation has a stereotype and tagged values, then the each tagged value must have the name of an attribute of the stereotype and a value that is legally interpretable for the type of that attribute. English stereotypeAnnotationTaggedValues If a stereotype annotation has a stereotype and a list of names, then all the names in the list must resolve to visible model elements and the stereotype must have a single attribute with a (metaclass) type and multiplicity that are consistent with the types and number of the elements denoted by the given names. English stereotypeAnnotationNames A set of tagged values for the applied stereotype. taggedValues public composite A set of references to model elements required for the stereotype being applied. names public composite The name of the stereotype being applied. stereotypeName public composite The stereotype denoted by the stereotype name. stereotype public true StereotypeAnnotation The definition of a package, all of whose members must be packageable elements. The applied profiles of a package definition are the profiles listed in any @apply annotations on the package. English packageDefinitionAppliedProfileDerivation The profiles applied (directly) to this package. * appliedProfile public true In addition to the annotations allowed on any namespace definition, a package definition allows @apply annotations plus any stereotype whose metaclass is consistent with Package. annotation public result public return annotationAllowed public Returns true of the namespace definition associated with the given unit definition is a package definition. unit public result public return matchForStub public Return true if the given member is either a PackageDefinition or an imported member whose referent is a PackageDefinition or a Package. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public PackageDefinition The definition of both a signal and a reception of that signal as a feature of the containing active class. A signal reception definition is a feature. English signalReceptionDefinitionIsFeatureDerivation SignalReceptionDefinition An import reference to a package all of whose public members are to be imported. The referent of a package import must be a package. English packageImportReferenceReferent PackageImportReference A reference to an element or package to be imported into a unit. The referent of an import reference is the element denoted by the referent name. English importReferenceReferentDerivation The referent name of an import reference must resolve to a single element with public or empty visibility. English importReferenceReferent An indication of the visibility of the import. visibility public The name of the element or package to be imported. referentName public composite The unit that is making this import reference. unit public A reference to the imported element denoted by the given qualified name. referent public true ImportReference true The definition of an association, whose members must all be properties. The specialization referents of an association definition must all be associations. English associationDefinitionSpecializationReferent Returns true if the given unit definition matches this association definition considered as a classifier definition and the subunit is for an association definition. unit public result public return matchForStub public In addition to the annotations allowed for classifiers in general, an association definition allows an annotation for any stereotype whose metaclass is consistent with Association. annotation public result public return annotationAllowed public Return true if the given member is either an AssociationDefinition or an imported member whose referent is an AssociationDefinition or an Association. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public AssociationDefinition A set of tagged values for a stereotype application. The tagged values in the set. * taggedValue public TaggedValueList The definition of an enumeration literal, as a member of an enumeration definition. Returns false. (Enumeration literal name cannot have annotations.) annotation public result public return annotationAllowed public EnumerationLiteralName The definition of an active class. If an active class definition is not abstract, then it must have a classifier behavior. English activeClassDefinitionClassifierBehavior The definition of an activity (which may be a stub) to act as the classifier behavior of the active class. classifierBehavior public Returns true if the given unit definition matches this active class definition considered as a class definition and the subunit is for an active class definition. unit public result public return matchForStub public ActiveClassDefinition The common properties of the definitions of typed elements. If the lower bound string image of a typed element definition is not empty, then the integer lower bound is the integer value of the lower bound string. Otherwise the lower bound is equal to the upper bound, unless the upper bound is unbounded, in which case the lower bound is 0. English typedElementDefinitionLowerDerivation The unlimited natural upper bound value is the unlimited natural value of the uper bound string (with "*" representing the unbounded value). English typedElementDefinitionUpperDerivation The type of a typed element definition is the single classifier referent of the type name. English typedElementDefinitionTypeDerivation The type name of a typed element definition must have a single classifier referent. This referent may not be a template. English typedElementDefinitionTypeName The string image of the literal given to specify the lower bound of the multiplicity of the element being defined. lowerBound public The string image of the literal given to specify the upper bound of the multiplicity of the element being defined. "1" upperBound public Whether the element being defined is ordered. isOrdered public Whether the element being defined is non-unique. isNonunique public The name of the type of the element being defined. typeName public composite type public true The multiplicity lower bound of the element being defined. lower public true The multiplicity upper bound of the element being defined. upper public true TypedElementDefinition true A typed element definition for the formal parameter of an activity or operation. If a formal parameter has direction "out" and a multiplicity lower bound greater than 0, and its owning activity or operation definition has an effective body, then there must be an assignment for the formal parameter after the effective body that has a multiplicity greater than 0. English formalParameterAssignmentAfterBody An indication of the direction of the parameter being defined. direction public Returns true if the annotation is for a stereotype that has a metaclass consistent with Parameter. annotation public result public return annotationAllowed public Return true if the given member is a FormalParameter. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public FormalParameter The definition of a namespace as an Alf unit. If a unit definition has a declared namespace name, then the containing namespace for the unit is the referent for that name. English unitDefinitionNamespaceDerivation The declared namespace name for a unit definition, if any, must resolve to a UML namespace of an Alf unit definition. If it is an Alf unit definition, then it must have a stub for this unit definition. English unitDefinitionNamespace A unit definition is for a model library if its associated namespace definition has a stereotype annotation for the UML standard stereotype ModelLibrary. English unitDefinitionIsModelLibraryDerivation Unless the unit definition is a model library, it has private package import references for all the sub-packages of the Alf::Library package. English unitDefinitionImplicitImports The profiles applied to a unit definition include any profiles applied to the containing namespace of the unit definition. If the unit definition is for a package, then the applied profiles for the unit definition also include the applied profiles for its associated package definition. English unitDefinitionAppliedProfileDerivation A declaration of the name of the namespace that contains this unit as a subunit. namespaceName public composite The definition of the unit as a namespace. definition public composite The set of references to imported elements or packages. * import public composite A reference to the namespace denoted by the declared namespace name for the unit, if any. namespace public true Whether this unit definition is for a model library or not. isModelLibrary public true The profiles applied to this unit. * appliedProfile public true UnitDefinition The definition of a class, whose members may be properties, operations, signals or signal receptions. The specialization referents of a class definition must all be classes. A class definition may not have any referents that are active classes unless this is an active class definition. English classDefinitionSpecializationReferent If a class definition is not abstract, then no member operations (owned or inherited) of the class definition may be abstract. English classDefinitionAbstractMember In addition to the annotations allowed for classifiers in general, a class definition allows an annotation for any stereotype whose metaclass is consistent with Class. annotation public result public return annotationAllowed public Returns true if the given unit definition matches this class definition considered as a classifier definition and the subunit is for a class definition. unit public result public return matchForStub public Return true if the given member is either a ClassDefinition or an imported member whose referent is a ClassDefinition or a Class. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public ClassDefinition A model of the common properties of the definition of a namespace in Alf. The members of a namespace definition include references to all owned members. Also, if the namespace definition has a unit with imports, then the members include imported members with referents to all imported elements. The imported elements and their visibility are determined as given in the UML Superstructure. The name of an imported member is the name of the imported element or its alias, if one has been given for it. Elements that would be indistinguishable from each other or from an owned member (as determined by the Member::isDistinguishableFrom operation) are not imported. English namespaceDefinitionMemberDerivation The members of a namespace must be distinguishable as determined by the Member::isDistinguishableFrom operation. English namespaceDefinitionMemberDistinguishability The definitions of owned members of the namespace. * ownedMember public true composite The unit for which this namespace is a definition, if any. unit public The owned and imported members of a namespace definition. * member public true Returns true if the annotation is @external. annotation public result public return annotationAllowed public NamespaceDefinition true The definition of a classifier. Each name listed in the specialization list for a classifier definition must have a single classifier referent. None of these referents may be templates. English classifierDefinitionSpecialization The specialization referents of a classifier definition are the classifiers denoted by the names in the specialization list for the classifier definition. English classifierDefinitionSpecializationReferentDerivation The members of a classifier definition include non-private members inherited from the classifiers it specializes. The visibility of inherited members is as specified in the UML Superstructure, Subclause 7.3.8. Elements inherited from external classifiers are treated as imported members. English classifierDefinitionInheritedMembers Whether the classifier is abstract or not. isAbstract public The names of classifiers specialized by the classifier being defined. specialization public composite References to the classifiers to which the names in the specialization list resolve. * specializationReferent public true The namespace definition associated with the given unit definition must be a classifier definition. The subunit classifier definition may be abstract if and only if the subunit classifier definition is abstract. The subunit classifier definition must have the same specialization referents as the stub classifier definition. (Note that it is the referents that must match, not the exact names or the ordering of those names in the specialization list.) The subunit classifier definition must also have a matching classifier template parameter for each classifier template parameter of the stub classifier definition. Two template parameters match if they have same names and the same specialization referents. unit public result public return matchForStub public ClassifierDefinition true The definition of a signal, whose members must all be properties. The specialization referents of a signal definition must all be signals. English signalDefinitionSpecializationReferent Returns true if the given unit definition matches this signal definition considered as a classifier definition and the subunit is for a signal definition. unit public result public return matchForStub public In addition to the annotations allowed for classifiers in general, a signal definition allows an annotation for any stereotype whose metaclass is consistent with Signal. annotation public result public return annotationAllowed public Return true if the given member is either a SignalDefinition or an imported member whose referent is a SignalDefinition or a Signal (where signal reception definitions are considered to be kinds of signal definitions). Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public SignalDefinition A model of the common properties of the definition of a member of a namespace in Alf. All stereotype annotations for a member must be allowed, as determined using the stereotypeAllowed operation. English memberAnnotations A member is primitive if it has a @primitive annotation. English memberIsPrimitiveDerivation A member is external if it has an @external derivation. English memberIsExternalDerivation If a member is external then it must be a stub. English memberExternal If a member is a stub and is not external, then there must be a single subunit with the same qualified name as the stub that matches the stub, as determined by the matchForStub operation. English memberStub If the member is a stub and is not external, then its corresponding subunit is a unit definition with the same fully qualified name as the stub. English memberSubunitDerivation If a member is a stub, then the it must not have any stereotype annotations that are the same as its subunit. Two stereotype annotations are the same if they are for the same stereotype. English memberStubStereotypes If a member is primitive, then it may not be a stub and it may not have any owned members that are template parameters. English memberPrimitive The name of the member. name public An indication of the visibility of the member outside of its namespace. visibility public Whether this member definition is a stub for a subunit. isStub public The namespace definition within which this member definition is nested, if any. (The namespace definitions for units are not physically nested within another Alf namespace definition.) namespace public The stereotype annotations on this member definition. * annotation public composite Whether this member is a feature of a classifier. isFeature public true Whether this member is a primitive or not. isPrimitive public true Whether this member is external or not. isExternal public true The subunit corresponding to the member, if the member is a stub. subunit public composite true Returns true of the given stereotype annotation is allowed for this kind of element. annotation public result public return annotationAllowed public true Returns true of the given unit definition is a legal match for this member as a stub. By default, always returns false. unit public result public return matchForStub public Returns true if this member is distinguishable from the given member. Two members are distinguishable if their names are different or the they are of different kinds (as determined by the isSameKindAs operation). However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isDistinguishableFrom public Returns true if this member is of the same kind as the given member. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public true Member true The declaration of the ability of an active class to receive a signal. The signal name for a reception definition must have a single referent that is a signal. This referent must not e a template. English receptionDefinitionSignalName The signal for a reception definition is the signal referent of the signal name for the reception definition. English receptionDefinitionSignalDerivation A reception definition is a feature. English receptionDefinitionIsFeatureDerivation The name of the signal to be received. signalName public composite signal public true Returns true if the annotation is for a stereotype that has a metaclass consistent with Reception. annotation public result public return annotationAllowed public Return true if the given member is either a ReceptionDefinition, a SignalReceptionDefinition or an imported member whose referent is a ReceptionDefinition, a SignalReceptionDefinition or a Reception. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public ReceptionDefinition An imported element is not a stub. English importedMemberNotStub An imported element is a feature if its referent is a feature. English importedMemberIsFeatureDerivation referent public Returns false. (Imported members do not have annotations.) annotation public result public return annotationAllowed public If the given member is not an imported member, then return the result of checking whether the given member is the same kind as this member. Else, if the element of the referent for this member is an Alf member, then return the result of checking whether that element is the same kind as the given member. Else, if the element of the referent for the given member is an Alf member, then return the result of checking whether that element is the same kind as this member. Else, the referents for both this and the given member are UML elements, so return the result of checking their distinguishability according to the rules of the UML superstructure. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public ImportedMember An import reference to a single element to be imported into a unit. The referent of an element import reference must be a packageable element. English elementImportReferenceReferent The alias to be used as the name for the imported element in the importing unit’s namespace. alias public ElementImportReference The definition of an enumeration, whose members must all be enumeration literal names. The specialization referents of a class definition must all be classes. A class definition may not have any referents that are active classes unless this is an active class definition. English enumerationDefinitionSpecializationReferent Returns true if the given unit definition matches this enumeration definition considered as a classifier definition and the subunit is for an enumeration definition. unit public result public return matchForStub public In addition to the annotations allowed for classifiers in general, an enumeration definition allows an annotation for any stereotype whose metaclass is consistent with Enumeration. annotation public result public return annotationAllowed public Return true if the given member is either an EnumerationDefinition or an imported member whose referent is an EnumerationDefinition or an Enumeration. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public EnumerationDefinition The definition of a data type, whose members must all be properties. If a data type is primitive, then it may not have any owned members. English dataTypeDefinitionPrimitive The specialization referents of a data type definition must all be data types. English dataTypeDefinitionSpecializationReferent Returns true if the given unit definition matches this data type definition considered as a classifier definition and the subunit is for a data type definition. unit public result public return matchForStub public In addition to the annotations allowed for classifiers in general, a data type definition allows @primitive annotations plus any stereotype whose metaclass is consistent with DataType. annotation public result public return annotationAllowed public Return true if the given member is either a DataTypeDefinition or an imported member whose referent is a DataTypeDefinition or a DataType. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public DataTypeDefinition The definition of an operation, with any formal parameters defined as owned members. The namespace for an operation definition must be a class definition. English operationDefinitionNamespace If an operation definition has a redefinition list, its redefined operations are the referent operations of the names in the redefinition list for the operation definition. Otherwise, the redefined operations are any operations that would otherwise be indistinguishable from the operation being defined in this operation definition. English operationDefinitionRedefinedOperationDerivation Each name in the redefinition list of an operation definition must have a single referent that is an operation. This operation must be a non-private operation that is a member of a specialization referent of the class definition of the operation definition. English operationDefinitionRedefinition The redefined operations of an operation definition must have formal parameters that match each of the formal parameters of this operation definition, in order. Two formal parameters match if they have the same direction, name, multiplicity bounds, ordering, uniqueness and type reference. English operationDefinitionRedefinedOperations An operation definition is a feature. English operationDefinitionIsFeatureDerivation An operation definition is a constructor if it has a @Create annotation. English operationDefinitionIsConstructorDerivation An operation definition is a destructor if it has a @Destroy annotation. English operationDefinitionIsDestructorDerivation An operation definition cannot be both a constructor and a destructor. English operationDefinitionConstructorDestructor If an operation definition is a constructor, any redefined operation for it must also be a constructor. The body of a constructor may contain an alternative constructor invocation for another constructor in the same class or super constructor invocations for constructors in immediate superclasses. English operationDefinitionConstructor If an operation definition is a destructor, any redefined operation for it must also be a destructor. English operationDefinitionDestructor The assignments before the effective body of an operation definition include an assignment for each "in" or "inout" formal parameter of the operation definition, with the formal parameter as the assigned source. English operationDefinitionEffectiveBodyAssignmentsBefore If an operation definition is a stub, then its effective body is the body of the corresponding subunit. Otherwise, the effective body is the same as the body of the operation definition. English operationDefinitionEffectiveBodyDerivation If an operation definition is abstract, then its body must be empty. English operationDefinitionAbstractOperation If an operation definition has a return parameter with a multiplicity lower bound greater than 0, then the effective body of the operation definition must have a return value. English operationDefinitionReturn The names of other operations that are redefined by the operation being defined. redefinition public composite Whether the operation being defined is abstract. isAbstract public The sequence of statements that defines the behavior of the operation (empty for a stub). body public composite * redefinedOperation public true Whether this operation definition is for a constructor. isConstructor public true Whether this operation definition is for a destructor. isDestructor public true If this operation definition is a stub, then the body of the corresponding subunit. effectiveBody public true Returns true if the annotation is for a stereotype that has a metaclass consistent with Operation. annotation public result public return annotationAllowed public The namespace definition associated with the given unit definition must be an activity definition with no template parameters. In addition, the subunit definition must have formal parameters that match each of the formal parameters of the stub definition, in order. Two formal parameters match if they have the same direction, name, multiplicity bounds, ordering, uniqueness and type reference If this operation definition is a constructor, then it is considered to have an implicit return parameter, following any other formal parameters, with the same type as the class of the operation definition and a multiplicity of 1..1. unit public result public return matchForStub public Return true if the given member is either an OperationDefinition or an imported member whose referent is an OperationDefinition or an Operation, and the formal parameters of this operation definition match, in order, the parameters of the other operation definition or operation. In this context, matching means the same name and type (per UML Superstructure, Subclause 7.3.5). A constructor operation without an explicit return parameter is considered to implicitly have a return parameter, following any other formal parameters, of the same type as the owner of the constructor operation. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public OperationDefinition The definition of a classifier template parameter, which acts as a classifier within the definition of the template. Annotations are not allowed on classifier template parameters. annotation public result public return annotationAllowed public Returns false. (Classifier template parameters cannot be stubs.) unit public result public return matchForStub public Return true if the given member is a classifier template parameter. Returns true if the given member is distinguishable from this member. By default, this means that the names of the members are different. However, in any case that the UML Superstructure considers two names to be distinguishable if they are different, an Alf implementation may instead impose the stronger requirement that the names not be conflicting. member public result public return isSameKindAs public ClassifierTemplateParameter An assignment of a value to an attribute of an applied stereotype. The name of the stereotype attribute to be assigned a value. name public The string image of a literal value to be assigned to the stereotype attribute. value public For a numeric value, an optional unary plus or minus operator. operator public TaggedValue The definition of an activity, with any formal parameters defined as owned members. An activity definition may not have a specialization list. English activityDefinitionSpecialization If an activity definition is primitive, then it must have a body that is empty. English activityDefinitionPrimitive The assignments before the effective body of an activity definition include an assignment for each "in" or "inout" formal parameter of the activity definition, with the formal parameter as the assigned source. English activityDefinitionEffectiveBodyAssignmentsBefore If an activity definition is a stub, then its effective body is the body of the corresponding subunit. Otherwise, the effective body is the same as the body of the activity definition. English activityDefinitionEffectiveBodyDerivation If an activity definition has a return parameter with a multiplicity lower bound greater than 0, then the effective body of the activity definition must have a return value. English activityDefinitionReturn The sequence of statements that defines the behavior of the activity (empty for a stub). body public composite If this activity definition is a stub, then the body of the corresponding subunit. effectiveBody public true In addition to the annotations allowed for classifiers in general, an activity definition allows @primitive annotations and any stereotype whose metaclass is consistent with Activity. annotation public result public return annotationAllowed public Returns true if the given unit definition matches this activity definition considered as a classifier definition and the subunit is for an activity definition. In addition, the subunit definition must have formal parameters that match each of the formal parameters of the stub definition, in order. Two formal parameters match if they have the same direction, name, multiplicity bounds, ordering, uniqueness and type reference. unit public result public return matchForStub public ActivityDefinition member public A_annotation_member unitDefinition public A_namespaceName_unitDefinition member public A_subunit_member importReference public A_referentName_importReference * namespaceDefinition public A_member_namespaceDefinition stereotypeAnnotation public A_names_stereotypeAnnotation stereotypeAnnotation public A_taggedValues_stereotypeAnnotation operationDefinition public A_redefinition_operationDefinition * activityDefinition public A_effectiveBody_activityDefinition * classifierDefinition public A_specializationReferent_classifierDefinition * importedMember public A_referent_importedMember stereotypeAnnotation public A_stereotype_stereotypeAnnotation stereotypeAnnotation public A_stereotypeName_stereotypeAnnotation packageDefinition public A_appliedProfile_packageDefinition * receptionDefinition public A_signal_receptionDefinition * typedElementDefinition public A_type_typedElementDefinition receptionDefinition public A_receptionDefinition_signalName * operationDefinition public A_redefinedOperation_operationDefinition activeClassDefinition public A_classifierBehavior_activeClassDefinition operationDefinition public A_body_operationDefinition * operationDefinition public A_effectiveBody_operationDefinition A_ownedMember_namespace * taggedValueList public A_taggedValue_taggedValueList A_definition_unit propertyDefinition public A_initializer_propertyDefinition activityDefinition public A_body_activityDefnition classifierDefinition public A_specialization_classifierDefinition * importReference public A_referent_importReference * unitDefinition public A_namespace_unitDefinition A_import_unit unitDefinition public A_appliedProfile_unitDefinition typedElementDefinition public A_typeName_typedElementDefinition Alf http://www.omg.org/spec/ALF/20170201 org.omg.xmi.nsPrefix alf