|
363
|
LCF considered as a programming language
– G D Plotkin
- 1977
|
|
173
|
Full Abstraction for PCF
– Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
- 1996
|
|
38
|
Observable Sequentiality and Full Abstraction
– Robert Cartwright, Matthias Felleisen
- 1992
|
|
17
|
When is a Functional Program Not a Functional Program?
– John Longley
- 1999
|
|
31
|
A Semantic analysis of control
– James David Laird
- 1998
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
10
|
Logical reasoning for higher-order functions with local state
– Nobuko Yoshida, Kohei Honda, Martin Berger, Queen Mary
- 2006
|
|
12
|
Descriptive and relative completeness for logics for higher-order functions
– Kohei Honda, Martin Berger, Nobuko Yoshida
- 2006
|
|
43
|
A type-theoretical alternative to ISWIM
– D Scott
- 1993
|
|
67
|
A Curry-Howard foundation for functional computation with control
– C. -h. L. Ong, C. A. Stewart
- 1997
|
|
174
|
On full abstraction for pcf
– M Hyland, L Ong
- 2000
|
|
19
|
A Uniform Approach to Domain Theory in Realizability Models
– John R. Longley, Alex K. Simpson
- 1996
|
|
55
|
Realizability Toposes and Language Semantics
– J Longley
- 1995
|
|
47
|
Sequentiality and strong stability
– A Bucciarelli, T Ehrhard
- 1991
|
|
22
|
Finitary PCF is not decidable
– Ralph Loader
- 1996
|
|
36
|
The sequentially realizable functionals
– John Longley
|
|
10
|
SPCF: its model, calculus, and computational power
– R Kanneganti, R Cartwright, M Felleisen
- 1993
|
|
22
|
Projecting Sequential Algorithms on Strongly Stable Functions
– Thomas Ehrhard
- 1993
|
|
83
|
Sequential algorithms on concrete data structures
– G Berry, P-L Curien
- 1982
|
