The sequentially realizable functionals

by John Longley
Citations:36 - 9 self

Active Bibliography

11 Notions of computability at higher types I – John Longley - 2005
29 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
1 Matching typed and untyped realizability (Extended abstract) – John Longley
17 Definability and full abstraction – Pierre-Louis Curien
32 A Semantic analysis of control – James David Laird - 1998
29 Games and full abstraction for nondeterministic languages – Russell S. Harmer - 1999
46 Algorithmic Game Semantics – Samson Abramsky - 2001
4 Games and Sequential Algorithms – Jim Laird - 2001
12 Sequential algorithms and strongly stable functions РPaul-Andr̩ Melli̬s - 2003
Realizability Models for Sequential Computation – John Longley - 1998
4 On the ubiquity of certain total type structures – John Longley - 2007
23 Correspondence between Operational and Denotational Semantics – C. -h. L. Ong - 1995
6 Comparing Hierarchies of Types in Models of Linear Logic – Paul-Andre Mellies - 2003
4 Axioms for Definability and Full Completeness – Samson Abramsky - 2000
3 Game semantics for an object-oriented language – Nicholas Wolverson - 2008
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
2 Applications of Game Semantics: From Program Analysis to Hardware Synthesis – Dan R. Ghica
31 Kripke Logical Relations and PCF – Peter W. O'Hearn, Jon G. Riecke - 1995
Extensional semantics of program behaviour – Guy McCusker - 2008