On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Proofs and types
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Recursion over realizability structures
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounded quantification is undecidable
Information and Computation
An extension of system F with subtyping
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Coherence of subsumption, minimum typing and type-checking in F≤
Theoretical aspects of object-oriented programming
Theoretical aspects of object-oriented programming
Extensible records in a pure calculus of subtyping
Theoretical aspects of object-oriented programming
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The development of type systems for object-oriented languages
Theory and Practice of Object Systems - Special issue: type systems
An interpretation of objects and object types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Information and Computation
A Theory of Objects
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
A Unifying Type-Theoretic Framework for Objects
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Decidability of Higher-Order Subtyping with Intersection Types
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
| Hi-index | 0.00 |
We study a variant of System F≤ that integrates and generalizes several existing proposals for calculi with "structural typing rules." To the usual type constructors (→, , All, Some, Rec) we add a number of type destructors, each internalizing a useful fact about the subtyping relation. For example, in F≤ with products every closed subtype of a product S×T must itself be a product S'T' with S' F ; ≤ TD, which imposes some restrictions in order to achieve a tractable metatheory. The properties of the latter system are developed in detail. 2002 Elsevier Science (USA)