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
Theoretical aspects of object-oriented programming: types, semantics, and language design
Theoretical aspects of object-oriented programming: types, semantics, and language design
Application of OOP type theory: state, decidability, integration
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Subtypes vs. where clauses: constraining parametric polymorphism
Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
A theory of primitive objects: second-order systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Theory and Practice of Object Systems - Special issue: type systems
Theory and Practice of Object Systems - Special issue: type systems
A Theory of Objects
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
PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Implementing signatures for C++
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-checking OQL queries in the ODMG type systems
ACM Transactions on Database Systems (TODS)
Type-based hot swapping of running modules (extended abstract)
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Typed interpretations of extensible objects
ACM Transactions on Computational Logic (TOCL)
Open and closed scopes for constrained genericity
Theoretical Computer Science
Research Frontiers in Object Technology
Information Systems Frontiers
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
On Problems in Polymorphic Object-Oriented Languages With Self Types and Matching
Fundamenta Informaticae
On Problems in Polymorphic Object-Oriented Languages With Self Types and Matching
Fundamenta Informaticae
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
| 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.