|
36
|
The sequentially realizable functionals
– John Longley
|
|
44
|
Algorithmic Game Semantics
– Samson Abramsky
- 2001
|
|
16
|
Definability and full abstraction
– Pierre-Louis Curien
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
|
Game Semantics and its Applications
– Luke Ong
|
|
5
|
Comparing Hierarchies of Types in Models of Linear Logic
– Paul-Andre Mellies
- 2003
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
2
|
Notions of computability at higher types II
– John Longley
- 2001
|
|
26
|
Sequentiality and the π-Calculus
– Martin Berger, Kohei Honda, Nobuko Yoshida
- 2001
|
|
1
|
Processes and Games
– Kohei Honda
- 2003
|
|
1
|
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
– Dan R. Ghica
|
|
4
|
On the ubiquity of certain total type structures
– John Longley
- 2007
|
|
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
|
|
4
|
Axioms for Definability and Full Completeness
– Samson Abramsky
- 2000
|
|
21
|
Asynchronous Games 2 - The true concurrency of innocence
– Paul-Andre Mellies
- 2004
|
|
|
Games in the Semantics of Programming Languages - An Elementary Introduction
– Jan Jürjens, Benedikt L Owe, Florian Rudolph (eds, Jan J Urjens
- 1999
|
|
23
|
Games and full abstraction for nondeterministic languages
– Russell S. Harmer
- 1999
|
|
|
Playful, streamlike computation
– Pierre-louis Curien
- 2003
|