J. Nordlander. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... be found in the first author s thesis [5, Chapter 9] and online on the web [19] 7 Related work and Conclusions Predating our work, the need for recursive bindings in the donotation was also discussed in the framework of the O Haskell language, a concurrent, object oriented extension to Haskell [16]. O Haskell extends the do notation with a variety of new features. With regard to recursion, O Haskell provides a special keyword fix, providing a way to specify a block of generators with mutual dependencies. The translation for fix blocks is a simpler version of ours: No segmentation is ....

NORDLANDER, J. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, Goteborg, Sweden, 1999.

.... [37] and the GHC compiler [26] Details on these implementations can be found on the web [74] Predating our work, the need for recursive bindings in the do notation was also discussed in the framework of Nordlander s O Haskell language, a concurrent, object oriented extension to Haskell [65]. O Haskell extends the do notation with a variety of new features. With regard to recursion, O Haskell provides a special keyword fix, providing a way to specify a block of generators with mutual dependencies. The translation for fix blocks is a simpler version of ours: No segmentation is ....

....point of view, as the approaches are fundamentally di#erent. From a practical point of view, much greater similarity to our work is found in Nordlander s O Haskell language. O Haskell is an object oriented extension of Haskell, designed for addressing issues in reactive functional programming [65]. One application of O Haskell is in programming layered network protocols. Each layer interacts with its predecessor and successor by receiving and passing information in both directions. In order to connect two protocols that have mutual dependencies, one needs a recursive knot tying operation. ....

Nordlander, J. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, Goteborg, Sweden, 1999. (96, 130, 136)

....with mutable nodes. For instance, we have previously described how such a technique can be used to implement doubly linked lists, where each node held a mutable boolean value [3] A similar situation arises in object oriented programming, when several objects need to refer to each other cyclically [10]. Once we describe the semantics for fixIO, we will revisit these examples to see how our system works in practice. 3 The language In this section, we define a language with monadic IO primitives, based on Haskell [12] Sorts: c constructors x, y, z, w heap variables r, s, t ....

Nordlander, J. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, Goteborg, Sweden, 1999.

....to the host. Its responses are e ected by programmed reactions; code sequences that are functional in the sense that we understand functions to be interpreted in monads that account for e ects. We think of reactions as functions from State to State, interpreted in the Events monad. O Haskell [9] is a programming language particularly well suited for writing reactive programs. The control of a reactive program determines which reactions shall be invoked in response to anticipated input events. This control could be described in imperative programming style, as it is in the Esterel ....

....when it is executing one of its methods in response to a message it has received. This set of characteristics (one might call them restrictions on an object s behavior) is characteristic of the actor model of computation [1] It has been used as a basis for the semantics of objects in O Haskell [9], a functional, objectoriented programming language. 5.1 O Haskell a functional language with simple objects O Haskell embeds a purely functional expression language based upon Haskell version 1.3, complementing the expression language with objects that encapsulate state. Unlike conventional ....

Johan Nordlander. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, 1999.

....Objects in Haskell contain only methods but no states. On the other hand, ObjectCurry provides real objects with states in the sense of object oriented programming. It combines the exibility of conventional object oriented languages with the features of functional logic programming. O Haskell [13, 14] provides an extension for full object oriented programming with states and subtype polymorphism. It uses monads for the implementation of concurrent objects and states. The main advantage of our implementation, which uses the concurrent and logical features of Curry, is the opportunity to combine ....

J. Nordlander. Reactive Objects and Functional Programming. PhD thesis, Chalmers Goteborg University, May 1999.

....: Unify s a ) Var s a a LP s ( unifyVar ref a = do mb readLPRef ref case mb of Nothing writeLPRef ref (Just a) Just b a : b The unification algorithm can now be implemented as follows. 3 This could be very much simplified if we had subtyping as in the language O Haskell [15]. 4 There exist a general polytypic solution to this problem [9, 10] which takes a similar approach. Unify s a ) a a LP s ( a : b = case (isVar a, isVar b) of (Just var1, Just var2) var1 = var2 true (Just var , unifyVar var b ( Just var ) unifyVar var ....

Johan Nordlander. Reactive Objects and Functional Programming. PhD thesis, Dept. of Computer Science, Chalmers University of Technology, 1999.

No context found.

J. Nordlander. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, 1999.

No context found.

Nordlander, Johan. Reactive Objects and Functional Programming. PhD thesis, Chalmers University of Technology, Gteborg, 1999.

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