Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Two semantic models of object-oriented languages
Theoretical aspects of object-oriented programming
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
A Theory of Objects
Formal Syntax and Semantics of Java
Formal Syntax and Semantics of Java
Dynamic Denotational Semantics of Java
Formal Syntax and Semantics of Java
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Nominal Games and Full Abstraction for the Nu-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
Typed Normal Form Bisimulation for Parametric Polymorphism
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
On notions of regularity for data languages
Theoretical Computer Science
Game semantics for call-by-value polymorphism
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic nominal game semantics
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Game Semantics for Good General References
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Game semantics for higher-order concurrency
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Observability, connectivity, and replay in a sequential calculus of classes
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
We consider an object calculus in which open terms interact with the environment through interfaces. The calculus is intended to capture the essence of contextual interactions of Middleweight Java code. Using game semantics, we provide fully abstract models for the induced notions of contextual approximation and equivalence. These are the first denotational models of this kind.