Projecting Sequential Algorithms on Strongly Stable Functions
نویسنده
چکیده
We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the \extensional projections" of some sequential algorithms. We deene a model of PCF where morphisms are \extensional" sequential algorithms and prove that any equation between PCF terms which holds in this model also holds in the strongly stable model.
منابع مشابه
Sequential algorithms and strongly stable functions
Intuitionistic proofs (or PCF programs) may be interpreted as functions between domains, or as strategies on games. The two kinds of interpretation are inherently different: static vs. dynamic, extensional vs. intentional. It is extremely instructive to compare and to connect them. In this article, we investigate the extensional content of the sequential algorithm hierarchy [−]SDS introduced by...
متن کاملGames and Full Abstraction for Pcf: Preliminary Announcement Intensional Full Abstraction
is one of the longest-standing problems in the semantics of programming languages. There is quite widespread agreement that it is one of the most diicult; there is much less agreement as to what exactly the problem is, or more particularly as to the precise criteria for a solution. The usual formulation is that one wants a \semantic characterization" of the fully abstract model (by which we mea...
متن کاملParallel and serial hypercoherences
It is known that the strongly stable functions which arise in the semantics of PCF can be realized by sequential algorithms, which can be considered as deterministic strategies in games associated to PCF types. Studying the connection between strongly stable functions and sequential algorithms, two dual classes of hypercoherences naturally arise: the parallel and serial hypercoherences. The obj...
متن کاملHybrid steepest-descent method with sequential and functional errors in Banach space
Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...
متن کاملTowards a Theory of Parallel Algorithms on Concrete Data Structures
Building on Kahn and Plotkin's theory of concrete data structures and sequential functions, Berry and Curien de ned an intensional model of sequential algorithms between concrete data structures. In this paper we report on an attempt to develop a similar intensional model of concurrent computation. We present a notion of parallel algorithm between concrete data structures, together with suitabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 77 شماره
صفحات -
تاریخ انتشار 1996