H. Sndergaard and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Inform., 27(6):505--517, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and O Donnell [10] and Wadler [23] That is, each choice injects its result into a monad with restricted operations. The ND monad has the added convenience of syntactic support in Haskell, and hence the type of ambND : a a ND a This is often stated as losing referential transparency [20] the numerous variants have been classified by semantic properties [21] Section 3.1 carefully characterises the properties of our choice operators within this classification. We explore the implications of the non standard evaluation order implied by introducing parallel speculation into a ....

H. Sndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27:505-- 517, 1990.

....is introduced in Eden by means of a predefined process abstraction merge : Process [ a] a] which fairly interleaves a set of input lists, to produce a single non deterministic list. The presence of non determinism creates some problems in Eden: It affects the referential transparency [HO90,SS90,SS92] of programs and invalidates some optimizations done in the GHC [San95] PS98] Such problems were precisely described in [PS01,PPRS00] In [PS01] a solution was proposed to solve this problem: To develop a static analysis to determine when an Eden expression is sure to be deterministic and ....

H. Sndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27(6):505--517, May 1990.

....union) that allows the creation of non deterministic sets and can be used to simulate amb. Other, such as choose : Set a a or (set intersection) are disallowed either because they violate referential transparency or because they cannot be implemented by remembering one value per set. In [SS90,SS92] the authors claim that what is really missing is an appropriate definition of referential transparency. They show that several apparently equivalent definitions have been around in different contexts and that they are not in fact equivalent in the presence of non determinism. To situate ....

H. Sndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27(6):505--517, May 1990.

....one value per set. In the paper, a denotational semantics based on Hoare powerdomains is given for the language and a number of useful equational laws are presented so that the programmer can formally reason about the (partial) correctness of programs. But the controversy goes further. In [SS90, SS92] the authors claim that what is really missing is an appropriate definition of referential transparency. They show that several apparently equivalent definitions (replacing equals by equals, unfoldability of definitions, absence of side effects, definiteness of variables, determinism, and ....

H. Sndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27(6):505--517, May 1990.

....this idea turns out to be 2 According to the Church Rosser property (Theorems I and II [120, 98] any reduction sequence should lead to the same normal form. 67 rather impractical, e.g. in an interactive application it is difficult to record all the possible choices. Sndergaard and Sestoft [117, 116] studied the impact of non determinism in functional languages independently from concurrency by adding directly nondeterministic operators into them. This is not explored further, as the aim of this thesis is to exclude non determinism in a concurrent setting. 5.2.2 Purely Functional Operating ....

H. Sndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27(6):505--517, 1990.

....the data type. Our result is that this is indeed possible, provided one incorporates the appropriate abstraction barrier in the calculus itself. It suffices to restrict the congruence (monotonicity) axiom to contexts without designated hidden symbols, i.e. imposing referential opacity, see [11, 16] for other uses of referential opacity. Without such an abstraction barrier, the resulting set of equations may be inconsistent since (the axioms for) hidden operators might not respect the intended equality predicate. Several proof system schemata for structured specifications exist, see [7] for ....

H. Sndergaard and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Inform., 27(6):505--517, 1990.

....for such mixed languages [2, 9, 10, 12, 13, 16, 21] these folklore claims about Algol s design clearly deserve a rigorous analysis. On one hand, such an analysis will enhance our understanding of the role of orthogonality in Algol in the same manner in which S ndergard s and Sestoft s paper [20] clarified the often misused terminology of referential transparency , and in which Felleisen s work [6] defined the idea of expressiveness of programming languages. On the other hand, the results are a contribution to the construction of simple logics for mixed functionalimperative programming ....

Søndergard, H. and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Informatica 27, 1990, 505--517.

....for such mixed languages [2, 9, 10, 12, 13, 16, 21] these folklore claims about Algol s design clearly deserve a rigorous analysis. On one hand, such an analysis will enhance our understanding of the role of orthogonality in Algol in the same manner in which S ndergard s and Sestoft s paper [20] clarified the often misused terminology of referential transparency , and in which Felleisen s work [6] defined the idea of expressiveness of programming languages. On the other hand, the results are a contribution to the construction of simple logics for mixed functional imperative ....

Søndergard, H. and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Informatica 27, 1990, 505--517.

No context found.

H. Sndergaard and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Inform., 27(6):505--517, 1990.

No context found.

H. Sndergaard and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Inform., 27(6):505--517, 1990.

No context found.

H. Sndergaard and P. Sestoft. Referential Transparency, Definiteness and Unfoldability. Acta Informatica, 27(6):505--517, May 1990.

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