Sciweavers

STTT
2010
194views more  STTT 2010»
13 years 6 months ago
Data-abstraction refinement: a game semantic approach
traction Refinement: A Game Semantic Approach Adam Bakewell2 , Aleksandar Dimovski1 , Dan R. Ghica2 , Ranko Lazi
Adam Bakewell, Aleksandar Dimovski, Dan R. Ghica, ...
MSCS
2006
85views more  MSCS 2006»
13 years 11 months ago
On sequential functionals of type 3
We show that the extensional ordering of the sequential functionals of pure type 3, e.g. as defined via game semantics [2, 4], is not cpo-enriched. ws that this model does not equ...
Dag Normann
APAL
2008
104views more  APAL 2008»
13 years 11 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
APAL
2008
61views more  APAL 2008»
13 years 11 months ago
Second-order type isomorphisms through game semantics
The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question i...
Joachim De Lataillade
APAL
2010
111views more  APAL 2010»
13 years 11 months ago
Resource modalities in tensor logic
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more prim...
Paul-André Melliès, Nicolas Tabareau
CONCUR
2010
Springer
13 years 11 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
ESOP
2008
Springer
14 years 1 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
ICALP
2000
Springer
14 years 3 months ago
Reasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
Dan R. Ghica, Guy McCusker
LICS
1999
IEEE
14 years 3 months ago
Concurrent Games and Full Completeness
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
Samson Abramsky, Paul-André Melliès
LICS
2000
IEEE
14 years 3 months ago
Game Semantics and Subtyping
While Game Semantics has been remarkably successful at g, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at...
Juliusz Chroboczek