|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
5
|
Games and full abstraction for PCF: preliminary announcement
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1993
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
|
27
|
Domains and Denotational Semantics: History, Accomplishments and Open Problems
– Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark
- 1996
|
|
23
|
Games and full abstraction for nondeterministic languages
– Russell S. Harmer
- 1999
|
|
|
Sequential Languages
– Robert Cartwright, Pierre-louis Curien, Matthias Felleisen
|
|
31
|
A Semantic analysis of control
– James David Laird
- 1998
|
|
197
|
Games and Full Completeness for Multiplicative Linear Logic
– Samson Abramsky, Radha Jagadeesan
- 1994
|
|
38
|
Observable Sequentiality and Full Abstraction
– Robert Cartwright, Matthias Felleisen
- 1992
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
13
|
A Relational Account of Call-by-Value Sequentiality
– Anders B. Sandholm, Jon G. Riecke
- 1999
|
|
2
|
Sequential Functions on Indexed Domains and Full Abstraction for a Sub-language of PCF
– Stephen Brookes, Shai Geva
- 1994
|
|
12
|
Continuous Functions and Parallel Algorithms on Concrete Data Structures
– Stephen Brookes, Shai Geva
- 1991
|
|
57
|
Game Theoretic Analysis Of Call-By-Value Computation
– Kohei Honda, NOBUKO YOSHIDA
- 1997
|
|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
|
Fully Abstract Bidomain Models of the λ-Calculus
– Jim Laird
- 2001
|
|
2
|
Parallel PCF has a Unique Extensional Model
– Allen Stoughton
- 1991
|
|
36
|
The sequentially realizable functionals
– John Longley
|
