Notions of computability at higher types I (2005)

Cached

Download Links

by John Longley
Venue:In Logic Colloquium 2000
Citations:12 - 5 self

Active Bibliography

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