An ideal model for recursive polymorphic types
Information and Control
A semantics of multiple inheritance
Information and Computation - Semantics of Data Types
Type theories and object-oriented programmimg
ACM Computing Surveys (CSUR)
A modest model of records, inheritance, and unbounded quantification
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Toward a typed foundation for method specialization and inheritance
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
F-bounded polymorphism for object-oriented programming
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A record calculus based on symmetric concatenation
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recursion over realizability structures
Information and Computation
Systems programming with Modula-3
Systems programming with Modula-3
PER models of subtyping, recursive types and higher-order polymorphism
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
An extension of system F with subtyping
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Polymorphism and subtyping in interface
IDL '94 Proceedings of the workshop on Interface definition languages
A Theory of Primitive Objects - Scond-Order Systems
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
A Theory of Primitive Objects - Untyped and First-Order Systems
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Relational Semantics for Recursive Types and Bounded Quantification
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Unifying Type-Theoretic Framework for Objects
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Simple objects for Standard ML
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
The ODMG object model: does it make sense?
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Parametric polymorphism for Java: a reflective solution
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Information and Computation - FOOL V
Type-safe convariant specialization with generalized matching
Information and Computation - FOOL VII
Products and polymorphic subtypes
Fundamenta Informaticae
On Object Systems and Behavioral Inheritance
IEEE Transactions on Software Engineering
Behavioral Compatibility of Self-Typed Theories
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Interpretations of Extensible Objects and Types
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
"Real World" as an Argument for Covariant Specialization in Programming and Modeling
OOIS '02 Proceedings of the Workshops on Advances in Object-Oriented Information Systems
Inheriting and Modifying Behavior
TOOLS '97 Proceedings of the Tools-23: Technology of Object-Oriented Languages and Systems
On the Behavioral Inheritance of State-Based Objects
TOOLS '00 Proceedings of the Technology of Object-Oriented Languages and Systems (TOOLS 34'00)
Typed operational semantics for higher-order subtyping
Information and Computation
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
Can programming be liberated from the two-level style: multi-level programming with deepjava
Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Products and Polymorphic Subtypes
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
A Subtyping for Extensible, Incomplete Objects
Fundamenta Informaticae
On model compatibility with referees and contexts
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
A relation between recursive object types, called matching, has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded subtyping (as was originally intended). We show that a new interpretation of matching as higher-order subtyping has better properties. Matching turns out to be a third-order construction, possibly the only one to have been proposed for general use in programming.