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 …
S Abramsky - Annals of pure and applied logic, 1991 - Elsevier
Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 (1991) 1– 77.• Domain theory, the mathematical theory of computation introduced by Scott as a …
Denotational semantics is a methodology for giving mathematical meaning to programming languages and systems. It was developed by Christopher Strachey's Programming …
This book serves as an introduction to an area of computability theory that originated in the 1950s, and since then has fanned out in many different directions under the influence of …
KR Apt, GD Plotkin - Journal of the ACM (JACM), 1986 - dl.acm.org
Four semantics for a small programming language involving unbounded (but countable) nondeterminism are provided. These comprise an operational semantics, two state …
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longeststanding problems in the semantics of programming languages. There is quite widespread agreement that it is …
J Laird - Proceedings of Twelfth Annual IEEE Symposium on …, 1997 - ieeexplore.ieee.org
This paper considers the consequences of relaxing the bracketing condition on'dialogue games', showing that this leads to a category of games which can be'factorized'into a well …
6 IA-{new} 7 Modelling new 8 Computational Adequacy 9 Full Abstraction 10 The Extensional Model 11 Related Work 12 Further Directions References The manipulation of …
I Christoff - International Conference on Concurrency Theory, 1990 - Springer
We present a framework in which the observable behavior of probabilistic processes is distinguished through testing. Probabilistic transition systems are used to model the …