Results 1  10
of
1,667
A Behavioral Notion of Subtyping
 ACM Transactions on Programming Languages and Systems
, 1994
"... The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of ..."
Abstract

Cited by 509 (13 self)
 Add to MetaCart
The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding
Subtyping object and recursive types logically
 In Proc. of ICTCS’05
, 2005
"... Abstract. We study subtyping in firstorder object calculi with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full firstorder ςcalculus is modeled by this notion, ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We study subtyping in firstorder object calculi with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full firstorder ςcalculus is modeled by this notion
Logical equivalence for subtyping object and recursive types
"... Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notion, which i ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notion, which
On understanding types, data abstraction, and polymorphism
 ACM COMPUTING SURVEYS
, 1985
"... Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Objectoriented languag ..."
Abstract

Cited by 845 (13 self)
 Add to MetaCart
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object
Subtyping object and recursive types logically (Draft)
, 2005
"... Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notion, which o ..."
Abstract
 Add to MetaCart
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notion, which
Subtyping Object and Recursive Types Logically (Extended Abstract)
"... Abstract. Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order ςcalculus is modelled by this notio ..."
Abstract
 Add to MetaCart
Abstract. Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full first order ςcalculus is modelled
Subtyping object and recursive types logically ⋆ (Extended Abstract)
"... Abstract. We study subtyping in firstorder object calculi with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full firstorder ςcalculus is modeled by this notion, ..."
Abstract
 Add to MetaCart
Abstract. We study subtyping in firstorder object calculi with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality in the full firstorder ςcalculus is modeled by this notion
Subtyping object and recursive types logically? (Extended Abstract)
"... Abstract. We study subtyping in firstorder object calculi with respect to thelogical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality inthe full firstorder &calculus is modeled by this notion ..."
Abstract
 Add to MetaCart
Abstract. We study subtyping in firstorder object calculi with respect to thelogical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality inthe full firstorder &calculus is modeled
Specification Matching of Software Components
 ACM Transactions on Software Engineering and Methodology
, 1996
"... Specification matching is a way to compare two software components based on descriptions of the components' behaviors. In the context of software reuse and library retrieval, it can help determine whether one component can be substituted for another or how one can be modified to fit the requ ..."
Abstract

Cited by 358 (4 self)
 Add to MetaCart
the requirements of the other. In the context of objectoriented programming, it can help determine when one type is a behavioral subtype of another. We use formal specifications to describe the behavior of software components, and hence, to determine whether two components match. We give precise definitions
ObjectOriented Type Inference
 OOPSLA'91
, 1991
"... We present a new approach to inferring types in untyped objectoriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, annotates the program with type information, allows polymorphic methods, and can be used as the basis of an optimizing co ..."
Abstract

Cited by 232 (15 self)
 Add to MetaCart
We present a new approach to inferring types in untyped objectoriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, annotates the program with type information, allows polymorphic methods, and can be used as the basis of an op
Results 1  10
of
1,667