|
363
|
LCF considered as a programming language
– G D Plotkin
- 1977
|
|
83
|
Sequential algorithms on concrete data structures
– G Berry, P-L Curien
- 1982
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
197
|
Games and Full Completeness for Multiplicative Linear Logic
– Samson Abramsky, Radha Jagadeesan
- 1994
|
|
58
|
Full Abstraction for Functional Languages with Control
– James Laird
- 1997
|
|
105
|
G.: A fully abstract game semantics for general references
– S Abramsky, K Honda, McCusker
- 1998
|
|
10
|
SPCF: its model, calculus, and computational power
– R Kanneganti, R Cartwright, M Felleisen
- 1993
|
|
34
|
On the symmetry of sequentiality
– P-L Curien
- 1993
|
|
52
|
Full abstraction for sequential languages: The state of the art
– G Berry, P Curien, J J Levy
|
|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
56
|
Hereditarily Sequential Functionals
– Hanno Nickau
- 1994
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
104
|
Fully Abstract Models of Typed Lambda Calculi, Th
– R Milner
- 1977
|
|
237
|
The Revised Report on the Syntactic Theories of Sequential Control and State
– Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb
- 1992
|
|
91
|
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions
– Samson Abramsky, Guy McCusker
- 1997
|
|
18
|
Studying the fully abstract model of PCF within its continuous function model
– A Jung, A Stoughton
- 1993
|
|
31
|
A Semantic analysis of control
– James David Laird
- 1998
|
|
38
|
Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d’État, Université Paris VII
– G Berry
- 1979
|
|
18
|
Fully abstract translations between functional languages
– Jon G Riecke
- 1991
|
