A semantics of multiple inheritance
Information and Computation - Semantics of Data Types
A modest model of records, inheritance, and unbounded quantification
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Research topics in functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully abstract semantics for observably sequential languages
Information and Computation
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Hi-index | 0.00 |
While Game Semantics has been remarkably successful at modeling, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at applying it to subtyping. We show how the simple device of explicitly introducing error values in the syntax of the calculus leads to a notion of subtyping for game semantics. We construct an interpretation of a simple lambda-calculus with subtyping and show how the range of the interpretation of types is a complete lattice thus yielding an interpretation of bounded quantification.