On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
A characterization of F-complete assignments
Theoretical Computer Science
A semantics of multiple inheritance
Information and Computation - Semantics of Data Types
Proofs and types
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
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
An algorithm for testing conversion in type theory
Logical frameworks
Semantics of type theory: correctness, completeness, and independence results
Semantics of type theory: correctness, completeness, and independence results
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
Programming with intersection types and bounded polymorphism
Programming with intersection types and bounded polymorphism
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of logic in computer science (vol. 2)
A type-theoretic approach to higher-order modules with sharing
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical aspects of object-oriented programming: types, semantics, and language design
Theoretical aspects of object-oriented programming: types, semantics, and language design
Applicative functors and fully transparent higher-order modules
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel reductions in &lgr;-calculus
Information and Computation
Theoretical Computer Science
Theoretical Computer Science
Using dependent types to express modular structure
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Theory of Objects
Types for Data-Oriented Languages
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Subtyping Calculus of Construction (Extended Abstract)
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtyping
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
A Kripke-Style Model for the Admissibility of Structural Rules
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
An Applicative Module Calculus
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Decidability of Higher-Order Subtyping with Intersection Types
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Higher-order subtyping and its decidability
Information and Computation
A syntactic approach to eta equality in type theory
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anti-symmetry of higher-order subtyping and equality by subtyping
Mathematical Structures in Computer Science
Extensional equivalence and singleton types
ACM Transactions on Computational Logic (TOCL)
Syntactic Metatheory of Higher-Order Subtyping
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for uniform feature composition
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polarized subtyping for sized types
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |
Bounded operator abstraction is a language construct relevant to object-oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω, a variant of Fω with this feature and with Cardelli and Wegner's kernel Fun rule for quantifiers. We define a typed operational semantics with subtyping and prove that it is equivalent with F≤ω, using logical relations to prove soundness. The typed operational semantics provides a powerful and uniform technique to study metatheoretic properties of F≤ω, such as Church-Rosser, subject reduction, the admissibility of structural rules, and the equivalence with the algorithmic presentation of the system that performs weak-head reductions.Furthermore, we can show decidability of subtyping using the typed operational semantics and its equivalence with the usual presentation. Hence, this paper demonstrates for the first time that logical relations can be used to show decidability of subtyping.