J. G. Riecke and R. Viswanathan. Isolating side effects in sequential languages. In Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, pages 1--12. ACM, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Incidentally, these operations correspond to effect delimiters, control operators, and store operators [22] We rely on the two above works [21, 26] for the soundness of this approach. Effect delimiters have been considered by a number of researchers for varying purposes. Riecke and Viswanathan [35, 36] construct fully abstract denotational semantics for languages with monadic effects. Launchbury and Peyton Jones [24] define an effect delimiter for the state monad with a second order polymorphic type to encapsulate state based computations. Similar operators have been used 12 by Dussart et al. ....

John Riecke and Ramesh Viswanathan. Isolating side effects in sequential languages. In POPL1995 [34], pages 1--12.

....and Pitts [CP92] define such an object in models of c , and discuss a logical system for reasoning about fixpoint computations, which may hold the answer to above questions. Another class of extensions is motivated by the application of the Retraction Theorem developed by Riecke and Viswanathan [RV95], where they show how one can isolate effects of an extension of a language with assignment or control from interfering with pure functional code. A natural question arises, whether it is possible to extend this approach to isolate one computational effect from interfering with code possibly ....

Jon G. Riecke and Ramesh Viswanathan. Isolating side effects in sequential languages. In In Proceedings of Symposium on Principles of Programming Languages, 1995.

....face to the outside world, without having to do any expensive run time checks. 10.1 Typechecked Segmentation Given the spread of run time mechanisms used for checking locality of references, from operating system segmentation checks to mechanisms for encapsulating effects in functional languages [10, 21, 22] it is perhaps surprising to discover that the type system is quite strong enough to do it statically. Of course, the fact that type systems can figure out the lifetimes of references has been known for some time [6] What distinguishes our solution based on runST is that it requires such minor ....

Riecke, J. G., and Viswanathan, R. Isolating side effects in sequential languages. In ACM Symposium on Principles of Programming Languages (1995), pp. 1--12.

....functional computation, not involving event synchronisations) if some side effect is required to obtain termination, the input event will never be enabled. This behaviour is consistent with the semantics of encapsulation constructs found in other theoretical programming languages, for instance [21]. As already stated, another construct that could be added to Pi are exceptions similar to those presented for Pi2. Here however, the possibility of detecting termination of expression evaluation also allows for an interrupt handling abstraction, that can also be seen as an object with internal ....

Jon G. Riecke and Ramesh Viswanathan. Isolating side effects in sequential languages. In Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, pages 1--12. ACM, 1995.

.... e.g. Swarup et al. 1991; Wadler, 1990b; Wadler, 1990a; Peyton Jones and Wadler, 1993; Guzm an and Hudak, 1990; Launchbury and Peyton Jones, 1995) Conservative extension results of the kind considered here have been a specific concern in (Odersky et al. 1993; Odersky, 1994; Riecke, 1993; Riecke and Viswanathan, 1995). 2 Idealized Algol Idealized Algol extends simply typed functional programming with primitive types for imperative features. We take the language PCF, a typed calculus with recursion and basic arithmetic constructs, as our representative pure functional language. The language IA (for Idealized ....

Riecke, J. G., and Viswanathan, R. 1995. Isolating side effects in sequential languages.

....the state would be referentially transparent [SRI91] Extensions of the type system have been proposed to account for exceptions [GS94] and Eother effects [JG89, JG91, TJ92, Tal93] These approaches rely upon static analysis to determine the possible scope of effects producing operations. Riecke [Rie93, RV95] has proposed an explicit, encapsulating operator for semantic effects, similar to the eval M operator we have proposed here. Riecke and Viswanathan offer semantic models for an otherwise functional language with recursive definitions and encapsulated effects. We have taken a logic based ....

John Riecke and Ramesh Viswanathan. Isolating side effects in sequential languages. In Conference Record of the Twenty Second Annual ACM Symposium on Principles of Programming Languages, pages 1--12, January 1995.

....approach pioneered by Sieber. Our model also supports a simple form of reasoning for showing that certain values are not definable, and yields insight into the structure of sequential computation. There are other ways to build fully abstract models for FPC. For instance, Riecke and Viswanathan [31, 32] give a dcpo based model for call by value FPC. The construction uses Milner s syntactic methods of [16] This construction sheds little light into the structure of FPC, except that the model validates least fixpoint reasoning. Games semantics has also been applied to full abstraction questions ....

J. G. Riecke and R. Viswanathan. Isolating side effects in sequential languages. In Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, pages 1--12. ACM, 1995.

....approach pioneered by Sieber. Our model also supports a simple form of reasoning for showing that certain values are not definable, and yields insight into the structure of sequential computation. There are other ways to build fully abstract models for FPC. For instance, Riecke and Viswanathan [31, 32] give a dcpo based model for call by value FPC. The construction uses Milner s syntactic methods of [16] This construction sheds little light into the structure of FPC, except that the model validates least fixpoint reasoning. Games semantics has also been applied to full abstraction questions ....

J. G. Riecke and R. Viswanathan. Isolating side effects in sequential languages. In Conference Record of the TwentySecond Annual ACM Symposium on Principles of Programming Languages, pages 1--12. ACM, 1995.

No context found.

J. G. Riecke and R. Viswanathan. Isolating side effects in sequential languages. In Conference Record of the TwentySecond Annual ACM Symposium on Principles of Programming Languages, pages 1--12. ACM, 1995.

.... there was exactly one fully abstract model of PCF meeting certain conditions (Milner, 1977) Until recently, all descriptions of this fully abstract model have used operational semantics (see, for instance, Mulmuley, 1987; Stoughton, 1988) New constructions using logical relations (O Hearn and Riecke, 1995; Sieber, 1992) have yielded a more abstract understanding of Milner s model. Game semantics (Abramsky et al. 1994; Hyland and Ong, 1995; Nickau, 1994) has also been used to give other semantic constructions of fully abstract models of PCF, even though it is still open whether these models are ....

....There is another, purely technical reason to be interested in FPC: since it contains only one trivial base type, we can learn more about the structure of Sieber s logical relations by studying FPC. Sieber s model of PCF, and the fully abstract model of PCF using Kripke relations (O Hearn and Riecke, 1995), begin from a set of n ary relations (for all n) at a flat base type i.e. where the convergent elements of the domain are unordered. PCF thus builds in a limited form of sum type, available only at the base type. When we decompose that base type into a sum of the primitive base type, we may ....

[Article contains additional citation context not shown here]

Riecke, J. G. and Viswanathan, R. (1995). Isolating side effects in sequential languages. In Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, pages 1--12. ACM.

No context found.

Jon G. Riecke and Ramesh Viswanathan. Isolating Side Effects in Sequential Languages. In Proceedings of the Twenty Second Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 1--12, San Francisco, January 1995.

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