Berry G.: Sequentialit'e de l'Evaluation Formelle des -expressions. Proc. 3rd International Colloquium on Programming, Paris, March 28--30, 1978, DUNOD. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Stability, Sequentiality and Demand Driven Evaluation in Dataflow - Avron, Sasson (2001) (Correct)
....is that from an abstract point of view, the largest class of operations which allows demand driven evaluation in dataflow is that of stable operations (which contain the sequential ones) It is rather interesting that the class of stable functions which was originally introduced by G. Berry (see [Ber76, Ber78a, Ber78b, Ber79]) has an important role in our work. What we actually show is that the following two properties are equivalent for a given set S of operations on streams of data tokens from flat domains: 1. Given any program P which is based on S and any demand D which P can satisfy, there exists a least legal ....
....filled. Basically, the above conjecture concerning sequential functions is proved in [Pin86] 9 . It turns out, however, that the condition of sequentiality is only sufficient for the existence of a least element in SP;D . A larger class of functions will in fact do: that of stable functions ([Ber76, Ber78a, Ber78b, Ber79]) Definition 3.4. Let D 1 and D 2 be cpos and let f : D 1 D 2 be a continuous function. We call f stable iff for every xfflD 1 and yfflD 2 where y f(x) there exists M(f; x; y)fflD 1 such that 8z x, y f(z) M(f; x; y) z. It is easy to show that sequentiality implies stability in the ....
Berry G.: Sequentialit'e de l'Evaluation Formelle des -expressions. Proc. 3rd International Colloquium on Programming, Paris, March 28--30, 1978, DUNOD.
Observable Sequentiality and Full Abstraction - Cartwright, Felleisen (1992) (17 citations) (Correct)
....of C[ such that P [ C[M 0 1 ; M 0 j Gamma1 ; Omega ; M 0 j 1 ; M 0 k ] P [ Omega Gamma ] for all expressions M 0 i ; i 6= j. This definition is based on Vuillemin s definition [26] of sequentiality for first order functions and Berry s generalization [2] of Vuillemin s definition to higher types. Plotkin proved that PCF is sequential [18:Activity Lemma] using an operational semantics for PCF that assigns the same meaning to PCF programs as the model C. 3 Observing Sequentiality PCF omits several language constructs that are essential in ....
Berry, G. S'equentialit'e de l'evaluation formelle des -expressions. In Proc. 3rd International Colloquium on Programming, 1978.
On the Expressive Power of Programming Languages - Felleisen (1990) (45 citations) (Correct)
....not a study of the expressiveness of programming languages. Some of his results may be relevant for future extensions of our work. A secondary piece of related work is the study of the full abstraction property of mathematical models [25, 31, 33] and the representability of functions in calculi [3, 4]. In many cases, the natural denotational model of a programming language contains too many elements so that operationally equivalent phrases have different mathematical meanings. Since it is relatively easy to reverse engineer a programming language from a model, the equality relation of models ....
Berry, G. S'equentialit'e de l'evaluation formelle des -expressions. In Proc. 3rd International Colloquium on Programming, 1978.
SPCF: Its Model, Calculus, and Computational Power.. - Kanneganti.. (1992) (Correct)
No context found.
Berry, G. S'equentialit'e de l'evaluation formelle des -expressions. In Proc. 3rd International Colloquium on Programming, 1978.
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