An intensional model for the programming language PCF is described in which the types of
PCF are interpreted by games and the terms by certain history-free strategies. This model is …

A games model of a programming language with higher-order store in the style of ML-
references is introduced. The category used for the model is obtained by relaxing certain …

The “classical” paradigm for denotational semantics models data types as domains, ie
structured sets of some kind, and programs as (suitable) functions between domains. The …

The very existence of the CONCUR conference bears witness to the fact that" concurrency
theory" has developed into a subject unto itself, with substantiaUy different emphases and …

Technical artifacts are taken to include all the common objects of everyday life, such as
chairs, televisions, paper clips, telephones, smartphones and dog collars. They are material …

A game semantics of finite nondeterminism is proposed. In this model, a strategy may make
a choice between different moves in a given situation; moreover, strategies carry extra …

We present a general semantic universe of call-by-value computation based on elements of
game semantics, and validate its appropriateness as a semantic universe by the full …

Nondeterminism is a pervasive phenomenon in computation. Often it arises as an emergent
property of a complex system, typically as the result of contention for access to shared …

A new category of games is developed which improves over existing such categories in that
it interprets sums as well as products, function spaces, and recursive types. A model of FPC …

The philosophy of computer science is concerned with the ontological and methodological
issues arising from within the academic discipline of computer science, and from the practice …