|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
36
|
The sequentially realizable functionals
– John Longley
|
|
10
|
Sequential algorithms and strongly stable functions
– Paul-André Melliès
- 2003
|
|
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
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
|
4
|
On the ubiquity of certain total type structures
– John Longley
- 2007
|
|
|
Realizability Models for Sequential Computation
– John Longley
- 1998
|
|
|
Notions of Computability for General Datatypes - Case For Support to accompany EPS(RP)
– M.P. Fourman, G. D. Plotkin, J.R. Longley
|
|
17
|
When is a Functional Program Not a Functional Program?
– John Longley
- 1999
|
|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
1
|
The Analysis of Programming Structure
– Jon G. Riecke
- 1997
|
|
|
Matching typed and untyped realizability (Extended abstract)
– John Longley
|
|
19
|
A Uniform Approach to Domain Theory in Realizability Models
– John R. Longley, Alex K. Simpson
- 1996
|
|
8
|
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
– Alex Simpson
- 2003
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
44
|
Algorithmic Game Semantics
– Samson Abramsky
- 2001
|
|
4
|
Axioms for Definability and Full Completeness
– Samson Abramsky
- 2000
|
|
|
Games in the Semantics of Programming Languages - An Elementary Introduction
– Jan Jürjens, Benedikt L Owe, Florian Rudolph (eds, Jan J Urjens
- 1999
|
|
11
|
Game Semantics and Subtyping
– Juliusz Chroboczek
- 1999
|
