The algebraic calculus for reasoning about the complete behavior of object types and the effects of axioms upon subtyping were analyzed. The translation of pure algebra into a piecemeal treatment in terms of variants, pre-, and post conditions was studied. The existing object subtyping rules were applied to derive subtyping rules governing the strengthening, or weakening of the assertions as there was a direct relationship between axiom strengthening, and subtyping. It was found that weaker preconditions co-existed with stronger invariants, and the same system satisfied the stronger of the two
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
AbstractOne of the central concepts supported by object-oriented databases is isa relationship. Its ...
This paper presents a careful analysis of the problem of reasoning about object-oriented programs. ...
The algebraic calculus for reasoning about the complete behavior of object types and the effects of ...
The theory of subtyping which judges object type compatibility from both the syntactic point of view...
This is the sixth article in a regular series on object-oriented type theory, aimed specifically at ...
Cardelli and Wegner developed a simple theory of object subtyping which was later to form the basis ...
The theory of subtyping which judges object type compatibility from both the syntactic point of view...
data types; F.3.2 [Logics and Meanings of Programs ] Semantics of Programming Languages --- algebrai...
Programmers informally reason about object-oriented programs by using subtype relationships to class...
This is the fifth article in a regular series on object-oriented type theory, aimed specifically at ...
The behavior of languages such as C++, Java, Smalltalk and Eiffel and the modeling features such cla...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact prin...
AbstractIn a previous paper we have defined a semantic preorder called operational subsumption, whic...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
AbstractOne of the central concepts supported by object-oriented databases is isa relationship. Its ...
This paper presents a careful analysis of the problem of reasoning about object-oriented programs. ...
The algebraic calculus for reasoning about the complete behavior of object types and the effects of ...
The theory of subtyping which judges object type compatibility from both the syntactic point of view...
This is the sixth article in a regular series on object-oriented type theory, aimed specifically at ...
Cardelli and Wegner developed a simple theory of object subtyping which was later to form the basis ...
The theory of subtyping which judges object type compatibility from both the syntactic point of view...
data types; F.3.2 [Logics and Meanings of Programs ] Semantics of Programming Languages --- algebrai...
Programmers informally reason about object-oriented programs by using subtype relationships to class...
This is the fifth article in a regular series on object-oriented type theory, aimed specifically at ...
The behavior of languages such as C++, Java, Smalltalk and Eiffel and the modeling features such cla...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact prin...
AbstractIn a previous paper we have defined a semantic preorder called operational subsumption, whic...
In a previous paper we have defined a semantic preorder called operational subsumption, which compar...
AbstractOne of the central concepts supported by object-oriented databases is isa relationship. Its ...
This paper presents a careful analysis of the problem of reasoning about object-oriented programs. ...