Typed Homomorphic Relations Extended with Sybtypes

Typed homomorphic relations on heterogeneous algebras are generalized to allow relationships between elements in the carrier sets of different types. Such relations are needed for the model theory of incomplete, hierarchical specifications with subtypes. Typed logical relations are generalized similarly. These tools help give a simple model-theoretic account of subtyping among abstract data types as observed by terms of a simply-typed lambda-calculus with subtypes.

[1]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Information and Computation.

[2]  Wim H. Hesselink,et al.  A mathematical approach to nondeterminism in data types , 1988, TOPL.

[3]  Gary T. Leavens.  Modular specification and verification of object-oriented programs , 1991, IEEE Software.

[4]  Richard Statman,et al.  Logical Relations and the Typed lambda-Calculus , 1985, Inf. Control..

[5]  Thierry Coquand,et al.  Inheritance and explicit coercion , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[6]  Gary T. Leavens,et al.  Modular Verification of Object-Oriented Programs with Subtypes , 1990 .

[7]  P. America,et al.  A behavioural approach to subtyping in object-oriented programming languages , 1991 .

[8]  H. Friedman.  Equality between functionals , 1975 .

[9]  J. Meseguer,et al.  Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems , 1993, Inf. Comput..

[10]  Pierre America,et al.  Inheritance and Subtyping in a Parallel Object-Oriented Language , 1987, ECOOP.

[11]  Kim B. Bruce,et al.  An Algebraic Model of Subtype and Inheritance , 1990, DBPL.

[12]  Gary T. Leavens,et al.  Reasoning about object-oriented programs that use subtypes , 1990, OOPSLA/ECOOP '90.

[13]  簡聰富,et al.  物件導向軟體之架構(Object-Oriented Software Construction)探討 , 1989 .

[14]  Thierry Coquand,et al.  INHERITANCE AND EXPLICIT COERCION (Preliminary Report) , 1989, LICS 1989.

[15]  John C. Reynolds,et al.  Using category theory to design implicit conversions and generic operators , 1980, Semantics-Directed Compiler Generation.