A relational account of call-by-value sequentiality

Authors:
Jon G. Riecke;Anders Sandholm
Affiliations:
Bell Laboratories Lucent Technologies, 700 Mountain Avenue, Murray Hill, New Jersey;BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, DK-8000 Aarhus C, Denmark
Venue:
Information and Computation - Special issue: LICS'97
Year:
2002

Citing 21
Cited 0

Full abstraction and semantic equivalence

Full abstraction and semantic equivalence
Partiality, cartesian closedness, and toposes

Information and Computation
Fully abstract translations between functional languages

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic domains

Handbook of theoretical computer science (vol. B)
Notions of computation and monads

Information and Computation
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
Isolating side effects in sequential languages

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Kripke logical relations and PCF

Information and Computation
Parametricity and local variables

Journal of the ACM (JACM)
Domain theory

Handbook of logic in computer science (vol. 3)
Pi-calculus, dialogue games and full abstraction PCF

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Categorical Combinators, Sequential Algorithms and Funtional Programming

Categorical Combinators, Sequential Algorithms and Funtional Programming
The Definition of Standard ML

The Definition of Standard ML
Hereditarily Sequential Functionals

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Full Abstraction for PCF

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A New Characterization of Lambda Definability

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Game Theoretic Analysis of Call-by-Value Computation

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Towards a theory of type structure

Programming Symposium, Proceedings Colloque sur la Programmation
Studying the Fully Abstract Model of PCF within its Continuous Function Model

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Games and Full Abstraction for FPC

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Syntactic Considerations on Recursive Types

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.