STTT
2010
13 years 7 months ago
2010
traction Refinement: A Game Semantic Approach Adam Bakewell2 , Aleksandar Dimovski1 , Dan R. Ghica2 , Ranko Lazi
MSCS
2006
14 years 20 days ago
2006
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...
APAL
2008
14 years 26 days ago
2008
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...
APAL
2008
14 years 26 days ago
2008
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...
APAL
2010
14 years 26 days ago
2010
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...
CONCUR
2010
Springer
14 years 28 days ago
2010
Springer
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 ...
ESOP
2008
Springer
14 years 2 months ago
2008
Springer
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...
ICALP
2000
Springer
14 years 4 months ago
2000
Springer
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 ...
LICS
1999
IEEE
14 years 5 months ago
1999
IEEE
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...
LICS
2000
IEEE
14 years 5 months ago
2000
IEEE
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...