(Enter summary)
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. (Update)
Context of citations to this paper: More
.... based, perhaps, on Kripke relations, which have also proven useful in approaching sequentiality [O Hearn and Riecke 1995; Riecke and Sandholm 1997]. 8. RELATION TO FUNCTOR MODELS While we have said that our translations are based on functor category models, the precise...
.... 17] From our point of view realisability models provide a link between purely denotational approaches via relational full abstraction [11, 14, 9] culminating in the category SD of sequential domains and operational semantics as given by the untyped programming language L. In...
Cited by: More
Relational Semantics for Higher-Order - Functional Programs Kamal
(Correct)
Relational Semantics of Local Variable Scoping - Kamal Aboul-Hosn Kamal
(Correct)
Pre-logical Relations - Honsell, Sannella (1999)
(Correct)
Similar documents (at the sentence level):
24.4%: A Relational Account of Call-by-Value Sequentiality - Riecke, Sandholm (1997)
(Correct)
19.9%: Programming Languages: Design, Analysis, and Semantics - Sandholm (2000)
(Correct)
Active bibliography (related documents): More All
0.4: Finitary PCF is not decidable - Loader (2001)
(Correct)
0.4: Isolating Side Effects in Sequential Languages - Riecke, Viswanathan (1995)
(Correct)
0.3: Semantic Orthogonality of Type Disciplines - Riecke, Subrahmanyam (1997)
(Correct)
Similar documents based on text: More All
1.2: A Simple Take on Typed Abstract Syntax in Haskell-like Languages - Danvy, Rhiger (2000)
(Correct)
1.2: A Unifying Approach to Goal-Directed Evaluation - Danvy, Grobauer, Rhiger (2001)
(Correct)
1.2: Normalization by Evaluation with Typed Abstract Syntax - Danvy, Rhiger, Rose (2001)
(Correct)
Related documents from co-citation: More All
6: Game-theoretic Analysis of Call-by-value Computation
- Honda, Yoshida - 1997
5: Full abstraction for PCF
- Abramsky, Jagadeesan et al. - 1994
5: On full abstraction for PCF (context) - Hyland, Ong - 1996
BibTeX entry: (Update)
J.G. Riecke and A.B. Sandholm. A relational account of call-by-value sequentiality. In Proceedings of 12th Annual Symposium on Logic in Computer Science, pages 258--267, 1997. http://citeseer.ist.psu.edu/article/riecke97relational.html More
@inproceedings{ riecke97relational,
author = "Jon G. Riecke and Anders Sandholm",
title = "A Relational Account of Call-by-value Sequentiality",
booktitle = "Proceedings, Twelfth Annual {IEEE} Symposium on Logic in Computer Science",
publisher = "IEEE Computer Society Press",
pages = "258--267",
year = "1997",
url = "citeseer.ist.psu.edu/article/riecke97relational.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
325
Towards a theory of type structure (context) - Reynolds - 1974
306
LCF considered as a programming language (context) - Plotkin
224
Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
211
Domain theory
- Abramsky, Jung - 1994
144
Full abstraction for PCF
- Abramsky, Malacaria et al. - 1994
131
The essence of Algol (context) - Reynolds - 1981
69
Relational properties of domains
- Pitts - 1996
65
Sequential Algorithms and Functional Programming (context) - Curien - 1986
48
Hereditarily sequential functionals
- Nickau - 1994
47
Fully Abstract Models of Programming Languages (context) - Stoughton
38
de l'interpr'etation de Godel `a l'analyse, et son applicati.. (context) - Girard - 1971
37
dialogue games and PCF (context) - Hyland, Ong - 1995
31
Games and full abstraction for FPC
- McCusker - 1996
26
From Algol to polymorphic linear lambda calculus
- O'Hearn, Reynolds - 1995
21
Reasoning about sequential functions via logical relations (context) - Sieber - 1992
20
A new characterization of lambda definability
- Jung, Tiuryn - 1993
19
Parametricity and local variables
- O'Hearn, Tennent - 1995
18
Fully abstract models of the typed lambda calculus (context) - Milner
17
Fully abstract translations between functional languages (context) - Riecke
16
Information and Computation (context) - O'Hearn, Riecke et al. - 1995
16
Studying the fully abstract model of PCF within its continuo.. (context) - Jung, Stoughton - 1993
14
Nondeterminism and fully abstract models (context) - Astesiano, Costa - 1980
12
Information and Control (context) - Moggi, computation - 1991
11
Isolating side effects in sequential languages
- Riecke, Viswanathan - 1995
8
Information and Computation (context) - Curien, Obtu et al. - 1989
6
Bulletin of the European Association for Theoretical Compute.. (context) - Jung, Fiore et al. - 1996
5
Full abstraction for call-by-value sequential languages (context) - Riecke, Viswanathan - 1993
5
logic for computable functions (context) - Plotkin - 1985
4
Number 25 in EATCS Monographs in Theoretical Computer Scienc.. (context) - Wechler, for
4
Extensions to type systems can preserve operational equivale.. (context) - Riecke, Subrahmanyam
3
Algebraically compact categories (context) - Freyd - 1991
1
http://hypatia.dcs.qmw.ac.uk (context) - Honda, Yoshida et al. - 1997
1
ACM Doctoral Dissertation Award (context) - Mulmuley, Semantic
1
http://hypatia.dcs.qmw.ac.uk (context) - Loader, is et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/RS/97/Ref/BRICS-RS-97-Ref/): More
Transforming Recursive Equations into Programs with Block.. - Danvy, Schultz (1997)
(Correct)
CoFI: The Common Framework Initiative for Algebraic Specification .. - Mosses (1997)
(Correct)
Syntax and Semantics of the logic ... - Butz (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC