|
36
|
The sequentially realizable functionals
– John Longley
|
|
55
|
Realizability Toposes and Language Semantics
– J Longley
- 1995
|
|
363
|
LCF considered as a programming language
– G D Plotkin
- 1977
|
|
47
|
Sequentiality and strong stability
– A Bucciarelli, T Ehrhard
- 1991
|
|
55
|
Hypercoherences: A Strongly Stable Model of Linear Logic
– Thomas Ehrhard
- 1993
|
|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
83
|
Sequential algorithms on concrete data structures
– G Berry, P-L Curien
- 1982
|
|
11
|
A relative definability result for strongly stable functions and some corollaries
– T Ehrhard
- 1997
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
56
|
Hereditarily Sequential Functionals
– Hanno Nickau
- 1994
|
|
19
|
A Uniform Approach to Domain Theory in Realizability Models
– John R. Longley, Alex K. Simpson
- 1996
|
|
34
|
On the symmetry of sequentiality
– P-L Curien
- 1993
|
|
43
|
A type-theoretical alternative to ISWIM
– D Scott
- 1993
|
|
77
|
The Effective Topos
– J Hyland
- 1982
|
|
15
|
Program Verification in Synthetic Domain Theory
– B Reus
- 1995
|
|
9
|
The Modified Realizability Topos
– Jaap Van Oosten, Jaap Van Oosten
- 1996
|
|
174
|
On full abstraction for pcf
– M Hyland, L Ong
- 2000
|
|
92
|
What is a Categorical Model of Intuitionistic Linear Logic?
– G.M. Bierman, A \gamma A, Gamma \delta \gamma C, Gamma I \gamma A, Gamma A B \gamma C, B \gamma C
- 1995
|
