Download:
|
by Jon G. Riecke, Anders Sandholm
http://www.brics.dk/~sandholm/Papers/LICS97/article.ps.gz
Add To MetaCart
Abstract:
We construct a model for FPC, a purely functional, sequential, call-by-value language. The model is built from partial continuous functions, in the style of Plotkin, further constrained to be uniform with respect to a class of logical relations. We prove that the model is fully abstract. 1.
Citations
|
347
|
Domain theory
– Abramsky, Jung
- 1994
|
|
240
|
Semantics of Programming Languages: Structures and Techniques. Foundations of Computing
– Gunter
- 1992
|
|
184
|
Une extension de l’interprétation de Gödel à l’analyse, et son application à l’élimination des coupures dans l’analyse et la théorie des types
– Girard
|
|
79
|
Categorical combinators, sequential algorithms and functional programming, Birkhauser
– Curien
- 1993
|
|
72
|
Full abstraction for PCF (extended abstract
– Abramsky, Jagadeesan, et al.
- 1994
|
|
61
|
Remarks on algebraically compact categories
– Freyd
- 1991
|
|
27
|
Domains and denotational semantics: History, accomplishments and open problems
– Fiore, Jung, et al.
- 1996
|
|
20
|
Studying the fully abstract model of PCF within its continuous function model
– Jung, Stoughton
- 1993
|
|
17
|
dialogue games and PCF
– Pi-calculus
- 1995
|
|
13
|
Nondeterminism and fully abstract models
– Astesiano, Costa
- 1980
|
|
9
|
Partiality, cartesian closedness, and toposes
– Curien, Obtulowicz
- 1989
|
|
2
|
Game theoretic analysis of callby -value computation. Unpublished manuscript available from "http://hypatia.dcs.qmw.ac.uk
– Honda, Yoshida
- 1997
|
