On full abstraction for PCF: I, II, and III

JME Hyland, CHL Ong - Information and computation, 2000 - Elsevier
We present an order-extensional, order (or inequationally) fully abstract model for Scott's
language pcf. The approach we have taken is very concrete and in nature goes back to S. C …

Deep inelastic scattering of polarized electrons by polarized and the study of the neutron spin structure

PL Anthony, RG Arnold, HR Band, H Borel, PE Bosted… - Physical Review D, 1996 - APS
The neutron longitudinal and transverse asymmetries A 1 n and A 2 n have been extracted
from deep inelastic scattering of polarized electrons by a polarized He 3 target at incident …

BPMN4CP: Design and implementation of a BPMN extension for clinical pathways

R Braun, H Schlieter, M Burwitz… - 2014 IEEE international …, 2014 - ieeexplore.ieee.org
The Business Process Model and Notation (BPMN) is a standard for business process
modeling that is very common in professional practice due to its expressiveness, the well …

Probabilistic game semantics

V Danos, RS Harmer - ACM Transactions on Computational Logic …, 2002 - dl.acm.org
A category of HO/N-style games and probabilistic strategies is developed where the
possible choices of a strategy are quantified so as to give a measure of the likelihood of …

A fully abstract game semantics for finite nondeterminism

R Harmer, G McCusker - … on Logic in Computer Science (Cat …, 1999 - ieeexplore.ieee.org
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 …

Resource modalities in tensor logic

PA Melliès, N Tabareau - Annals of Pure and Applied Logic, 2010 - Elsevier
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 …

Asynchronous games 2: The true concurrency of innocence

PA Melliès - Theoretical Computer Science, 2006 - Elsevier
In game semantics, the higher-order value passing mechanisms of the λ-calculus are
decomposed as sequences of atomic actions exchanged by a Player and its Opponent …

Nondeterminism in game semantics via sheaves

T Tsukada, CHL Ong - … 30th Annual ACM/IEEE Symposium on …, 2015 - ieeexplore.ieee.org
Harmer and McCusker have developed a fully abstract game model for nondeterministic
Idealised Algol and, at the same time, revealed difficulties in constructing game models for …

Probabilistic concurrent game semantics

H Paquet - 2020 - cl.cam.ac.uk
Probabilistic concurrent game semantics Page 1 Technical Report Number 950 Computer
Laboratory UCAM-CL-TR-950 ISSN 1476-2986 Probabilistic concurrent game semantics Hugo …

Asynchronous games 2: the true concurrency of innocence

PA Mellies - International Conference on Concurrency Theory, 2004 - Springer
In game semantics, one expresses the higher-order value passing mechanisms of the λ-
calculus as sequences of atomic actions exchanged by a Player and its Opponent in the …