A fully abstract games model of Reynolds ' Idealized Algol is described. The model gives a semantic account of the distinction between active types, such as commands, which admit side-effecting behaviour, and passive types, such as expressions, which do not. Keywords: Algol-like languages, game semantics, full abstraction. 1
|
2776
|
R.: Communication and Concurrency
– Milner
- 1989
|
|
1467
|
The Definition of Standard ML
– Milner, Tofte, et al.
- 1990
|
|
1078
|
Calculus of communicating systems
– Milner
|
|
333
|
LCF considered as a programming language
– Plotkin
- 1977
|
|
301
|
Introduction to higher order categorical logic. Cambridge studies in advanced mathematics
– Lambek, Scott
- 1986
|
|
282
|
Functions as processes
– Milner
- 1992
|
|
243
|
Semantics of Programming Languages: Structures and Techniques
– Gunter
- 1992
|
|
202
|
Basic Concepts of Enriched Category Theory, volume 64
– Kelly
- 1982
|
|
169
|
Games and full completeness for multiplicative linear logic
– Abramsky, Jagadeesan
- 1994
|
|
169
|
Revised report on the algorithmic language Scheme
– Kelsey, Clinger, et al.
- 1998
|
|
133
|
The essence of Algol
– Reynolds
- 1981
|
|
103
|
Fully Abstract Models of Typed Lambda-Calculi
– Milner
- 1977
|
|
90
|
What is a categorical model of intuitionistic linear logic
– Bierman
- 1995
|
|
82
|
A fully abstract game semantics for general references
– Abramsky, Honda, et al.
- 1998
|
|
77
|
Sequential algorithms on concrete data structures
– Berry, Curien
- 1982
|
|
72
|
Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions
– Abramsky, McCusker
- 1997
|
|
51
|
Hereditarily Sequential Functionals
– Nickau
- 1994
|
|
50
|
The Formal Semantics of Programming Languages. Foundations of Computing
– Winskel
- 1993
|
|
48
|
Retracing Some Paths in Process Algebra
– Abramsky
- 1996
|
|
47
|
Full abstraction for functional languages with control
– Laird
- 1997
|
|
45
|
Recursive functionals and quantifiers of finite types
– Kleene
- 1959
|
|
42
|
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
– McCusker
- 1996
|
|
41
|
Call-by-value games
– Abramsky, McCusker
- 1998
|
|
40
|
Fully Abstract Semantics for Observably Sequential Languages
– Cartwright, Curien, et al.
- 1994
|
|
38
|
Game semantics & abstract machines
– Danos, Herbelin, et al.
- 1996
|
|
38
|
On full abstraction for
– Hyland, Ong
|
|
34
|
Processes: A mathematical model of computing agents
– Milner
- 1973
|
|
28
|
Games and full abstraction for the lazy -calculus
– Abramsky, McCusker
- 1995
|
|
26
|
Full abstraction for Idealized Algol with passive expressions. Theoretical Computer Science
– Abramsky, McCusker
- 1999
|
|
16
|
Games and full abstraction for FPC
– McCusker
- 1996
|
|
15
|
Axioms for full abstraction and full completeness
– Abramsky
- 1996
|
|
10
|
Turing-machine computable functionals of finite types
– Kleene
- 1962
|
|
9
|
Handbook of Categorical Algebra, volume 1
– Borceux
- 1994
|
|
6
|
A fully-abstract model for the -calculus (extended abstract
– Fiore, Moggi, et al.
- 1996
|
|
4
|
Finitary PCF is not decidable. Unpublished manuscript
– Loader
- 1996
|
|
3
|
Full abstraction for PCF. Accepted for publication in Information and Computation
– Abramsky, Jagadeesan, et al.
- 1997
|
|
3
|
Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV
– Kleene
- 1985
|
|
1
|
Games and full abstraction for FPC (full version
– McCusker
- 1996
|
|
