|
7
|
Expressibility of functions in Scott's LCF language, Algebra and Logic 15
– V Sazonov
- 1976
|
|
8
|
Interdefinability of parallel operations
– A Stoughton
- 1991
|
|
5
|
Another approach to sequentiality: Kleene’s unimonotone functions
– A Bucciarelli
- 1993
|
|
2
|
Full abstraction for PCF, Information and Computation 163 (2) (2000) 409–470, an extended abstract can be found
– S Abramsky, P Malacaria, R Jagadeesan
- 1994
|
|
1
|
Stable models of typedλ-calculi, in
– G Berry
|
|
1
|
LCF considerd as a programming language, Theoretical Computer Science 5
– G D Plotkin
- 1977
|
|
1
|
LCF be topped? Flat lattice models of typedλ-calculus, Information and Computation 87
– B Bloom, Can
- 1990
|
|
1
|
Séquentialité de l’evaluation formelle desλ-expressions, in
– G Berry
- 1978
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
|
5
|
A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science 121
– D S Scott
- 1993
|
|
28
|
Full abstraction for
– S Abramsky, R Jagadeesan, P Malacaria
- 2000
|
|
12
|
Sequential models of PCF: some contributions to the domain-theoretic approach to full abstraction
– A Bucciarelli
- 1993
|
|
47
|
Fully abstract semantics for observably sequential languages
– Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen
- 1994
|
|
25
|
Full Abstraction and Semantic Equivalence
– K Mulmuley
- 1987
|
|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
7
|
The sequentially realizable functionals,” Annals of Pure and
– J Longley
- 1927
|
|
18
|
Sequentiality in an Extensional Framework
– Antonio Bucciarelli, Thomas Ehrhard
- 1993
|
|
8
|
Domains for denotational semantics. In Automata, languages and programming
– Dana S Scott
- 1982
|
|
31
|
Kripke Logical Relations and PCF
– Peter W. O'Hearn, Jon G. Riecke
- 1995
|
