Projecting Sequential Algorithms on Strongly Stable Functions (1993)

Cached

Download Links

by Thomas Ehrhard
Venue:Annals of Pure and Applied Logic
Citations:22 - 2 self

Active Bibliography

4 On Strong Stability and Higher-Order Sequentiality – Loic Colson , Thomas Ehrhard - 1994
23 Correspondence between Operational and Denotational Semantics – C. -h. L. Ong - 1995
12 Notions of computability at higher types I – John Longley - 2005
17 Definability and full abstraction – Pierre-Louis Curien
13 Sequential algorithms and strongly stable functions – Paul-André Melliès - 2003
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
31 Games and full abstraction for nondeterministic languages – Russell S. Harmer - 1999
36 The sequentially realizable functionals – John Longley
Playful, streamlike computation – Pierre-louis Curien - 2003
32 A Semantic analysis of control – James David Laird - 1998
59 Game Theoretic Analysis Of Call-By-Value Computation – Kohei Honda, NOBUKO YOSHIDA - 1997
3 Bistable biorders: a sequential domain theory – J. Laird - 2005
192 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
66 Full Abstraction for PCF (Extended Abstract) – Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan - 1994
6 Comparing Hierarchies of Types in Models of Linear Logic – Paul-Andre Mellies - 2003
2 Applications of Game Semantics: From Program Analysis to Hardware Synthesis – Dan R. Ghica
2 Linear Programming Languages – Luca Paolini, Mauro Piccolo
20 Strong Stability and the Incompleteness of Stable Models for λ-Calculus – Olivier Bastonero, Xavier Gouy - 1999