Full abstraction in the lazy lambda calculus

S Abramsky, CHL Ong - Information and Computation, 1993 - Elsevier
A theory of lazy λ-calculus is developed as a basis for lazy functional programming
languages. This is motivated by a mismatch between the" standard"(ie, sensible) theory of …

Full abstraction for PCF

S Abramsky, R Jagadeesan, P Malacaria - Information and computation, 2000 - Elsevier
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 …

Domain theory in logical form

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 …

[PDF][PDF] A Methodology for Language Development

DA Schmidt - 1997 - risc.jku.at
Denotational semantics is a methodology for giving mathematical meaning to programming
languages and systems. It was developed by Christopher Strachey's Programming …

[图书][B] Higher-order computability

J Longley, D Normann - 2015 - Springer
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 …

Countable nondeterminism and random assignment

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 …

Full abstraction for PCF

S Abramsky, P Malacaria, R Jagadeesan - … '94 Sendai, Japan, April 19–22 …, 1994 - Springer
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 …

Full abstraction for functional languages with control

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 …

Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions

S Abramsky, G McCusker - Algol-like languages, 1997 - Springer
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 …

Testing equivalences and fully abstract models for probabilistic processes

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 …