T. Brus, M. C. J. D. van Eekelen, M. van Leer, M. J. Plasmeijer, and H. P. Barendregt. CLEAN --- a language for functional graph rewriting. In Kahn, editor, Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA'87), number 274 in LNCS, pages 364--384. Springer-Verlag, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....implementations of other functional languages. Systems used in this comparison are: The Bigloo version 2.1c Scheme compiler [26] compiling to native code via gcc 03; the Bigloo optinfization op tion fstack was also used) SML NJ release 110 with the CML extensions [25] and CLEAN version 1.3. 2 [6]. Like Erlang, Scheme is a strict, dynanfically typed language. CML is concurrent, statically typed, and strict. CLEAN is statically typed and lazy. This experiment was conducted on a two processor 248 MHz Sun Ultra Enterprise 3,000 with 1.2 GB of primary memory running Solaris 2.7 using the ....

Brus T., van Eekelen M.C.J.D., van Leer M., Plasmeijer M.J., Barendregt H.P.: CLEAN - a language for functional graph rewriting. In: Kahn G., (ed.): Proc. Conference on Functional Programming Languages and Computer Architecture (FPCA '87). LNCS 274. Berlin, Heidelberg, New York: Springer- Verlag, 1987, pp. 364-384

....investigation. Examples of this functional approach to spreadsheet design are Scheme in a Grid [16] which combines traditional spreadsheets with the functional language Scheme, and De Hoon s MSc thesis [11] which discusses the implementation of a spreadsheet using the functional language clean [5]. 2.7.2 Spreadsheets and Dataflow Systems such as Scheme in a Grid [16] and FunSheet [11] demonstrate a link between spreadsheets and the declarative programming paradigm. Some systems exploit this link by providing a dataflow interpretation of spreadsheets, providing spreadsheet users with ....

T. Brus, M. van Eekelen, M. van Leer, M. Plasmeijer, and H. Barendregt. Clean --- a language for functional graph rewriting. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA '87). Springer-Verlag, 1987.

....we are not concerned with optimality questions, and we restrict our attention to argument sharing in a language which is simpler than the calculus. Much of the past work on graph rewriting has been to prove its correctness with respect to either the calculus [20] or Term Rewriting Systems [7, 8, 9, 16]. In contrast, this paper explores graph rewriting as a system in its own right, and makes no attempt to prove the correctness of a graph implementation with respect to a tree (or unshared) view of the computation. Motivated by what we have observed in real implementations of functional ....

T. Brus, M. van Eekelen, M. vam Leer, and M. Plasmeijer. Clean - A language for Functional Graph Rewriting. In Proc. ACM Conference on Functional Programming Languages and Computer Architecture, Portland, OR, Springer-Verlag LNCS 274, 1987.

.... else if ( i = k ) p ac( a[i] a[j] else if ( j = k ) p bc( a[i] a[j] else unequal p( a[i] a[j] a[k] Figure 2: Hand coded alias analysis at the callsite [20] Several authors have proposed variations of linear type systems or uniqueness annotations for pointers [3, 6, 16, 22, 5]; these ensure that the given pointer is the only one that points to the target location. These are often used in functional languages, where partial copies of data structures can be made to ensure uniqueness. In non functional languages there are also some techniques, such as alias burying [4] ....

T. H. Brus, M. C. J. D. van Eekelen, M. O. van Leer, and M. J. Plasmeijer. Clean: A language for functional graph rewriting. In G. Kahn, editor, Functional Programming Languages and Computer Architecture, volume 274 of Lecture Notes in Computer Science, pages 364-384. Springer-Verlag, Berlin, 1987.

....of pattern matching is how many bindings a pattern match yields: In the single match style, a successful match yields just one binding. This style is usually taken in declarative programming languages. In particular, most functional programming languages [4] such as CAML [8,30] Clean [6,24], Erlang [2,1] Gofer [14] Haskell [15,23] or ML [9,18] allow de ning functions by pattern matching. In the all match style, a pattern match yields a set of bindings corresponding to all possible matches. This style is often used in query languages and in programming languages based on term ....

Brus, T. H., M. C. J. D. van Eekelen, M. O. van Leer, M. J. Plasmeijer and H. P. Barendregt, CLEAN - A language for functional graph rewriting, in: Kahn, editor, In Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA'87), number 274 in Lecture Notes in Computer Science (1987), pp. 364-384.

....of an essential fragment of the Object I O library to demonstrate the feasibility. We take especial consideration for the relevant design choices. One particular design choice, how to handle state, results in two versions. 1 Introduction The pure, lazy, functional programming language Clean [8, 16, 20] o ers a sophisticated library for programmers to construct Graphical User Interfaces (GUI) on a high level of abstraction, the Object I O library. The uniqueness type system [22, 7] of Clean is the fundamental tool to allow safe and ecient Input Output. This has been taken advantage of in the ....

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. Clean: A Language for Functional Graph Rewriting. In Kahn. G. ed. Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364-384.

....but essential fragment of the Object I O library to demonstrate the feasibility. We take especial consideration for the relevant design choices. One particular design choice, how to handle state, results in two versions. 1 Introduction The pure, lazy, functional programming language Clean [8, 14, 18] o ers a sophisticated library for programmers to construct Graphical User Interfaces (GUI) on a high level of abstraction, the Object I O library. The uniqueness type system [20, 7] of Clean is the fundamental tool to allow safe and ecient Input Output. This has been taken advantage of in the ....

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. Clean: A Language for Functional Graph Rewriting. In Kahn. G. ed. Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364-384.

....small micro computers (such as a Macintosh Plus equipped with only 2.5M of RAM) In this paper we will discuss the memory management part of the Concurrent Clean system. The description will be given with the aid of the abstract ABC machine which is used for the compilation of Concurrent Clean Brus et al. 1987), Smetsers (1989) Eekelen et al. 1990) The ABC machine (Koopman et al. 1990) is a stack based graph reduction machine, similar to advanced G machine like architectures (e.g. Johnsson (1987) Peyton Jones Salkild (1989) The actual target processor for implementing the ABC machine is the ....

Brus T., Eekelen M.C.J.D. van, Leer M. van, Plasmeijer M.J. (1987), 'Clean - a Language for Functional Graph Rewriting', Proc. of the third International Conference on Functional Programming Languages and Computer Architecture (FPCA '87), Portland, Oregon, USA, Springer Lecture Notes on Computer Science 274, pp. 346-384.

....of the fact that Clean is a strongly typed language. In this paper we show how the evaluation of interactive objects is implemented in the object I O library. The evaluation can be handled elegantly using lazy evaluation. 1 Introduction For many years the functional programming language Clean [7, 13, 14] enables programmers to create efficient, interactive applications that use Graphical User Interfaces (GUIs) This is done by means of an extensive library that has been developed in Clean. The first publicly available version was the 0.8 I O library [1, 2] Newer versions have emerged, ....

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. Clean: A Language for Functional Graph Rewriting. In Kahn. G. ed. Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364-384.

....section 8) but none of them are completely satisfactory. In particular it is very hard to deal with the side effect problem. In this paper we present Clean s Event I O , a new solution for the I O problem that has been implemented in the lazy functional graph rewriting language Concurrent Clean [5], 13] 17] developed at the University of Nijmegen. This solution not only deals with the problems mentioned above but it also allows the specification of complicated window based I O on a very high level of abstraction. Last but not least, the presented solution can be implemented efficiently and ....

....high level specification of Clean s Event I O. The implementation of the I O library is discussed in section 6. Section 7 discusses Clean Event I O and it is compared with other solutions in section 8. Conclusions and future work can be found in section 9. 2 Concurrent Clean Concurrent Clean [5], 13] 17] is a lazy functional programming language based on Term Graph Rewriting [4] Here is an example of a Clean function defining the well known fibonacci function. Fib INT INT; Fib 1 1; Fib 2 1; Fib n (Fib ( n 1) Fib ( n 2) IF n 2 ABORT Fib called with ....

Brus T, Eekelen van MCJD, Plasmeijer MJ and Barendregt HP. Clean - A Language for Functional Graph Rewriting. In: Proc. of Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, Springer Verlag, LNCS 274, 1987, pp. 364-384.

....to do destructive updates in a pure functional framework, plays a crucial role. Furthermore, the object I O system makes extensive use of new type system facilities, namely type constructor classes and existential types. 1 Introduction In the pure, lazy, functional programming language Clean [7] [18] 19] one can develop real world applications using a high level I O system, released as version 0.8 [2] 3] It is available for programmers in the form of a library. The major part of the library is written completely in Clean, and only a small part interfaces with the operating system. ....

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. Clean: A Language for Functional Graph Rewriting. In Kahn. G. ed. Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364-384.

....(1995) This has given rise to the opinion that functional programming comes of age (Pountain (1994) The spreadsheet project of which the results are described in this paper was set out to gather evidence to support this opinion. In the lazy, functional graph rewriting language Clean (Brus et al. 1987), N cker et al. 1991) Plasmeijer van Eekelen (1994) uniqueness typing (Barendsen Smetsers (1993) which is based on the underlying graph rewriting model (Barendregt et al. 1987) Plasmeijer van Eekelen (1993) can be used to indicate that upon its evaluation a function will hold the ....

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. 1987. Clean: A Language for Functional Graph Rewriting. In Kahn. G. (editor), Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, pp. 364-384. Springer-Verlag.

....applications is briefly discussed in section 9. Section 10 discusses a number of encountered problems and suggests some 2 ideas to cope with them. Finally the paper is concluded by section 11 which summarises the whole and presents some future work. 2. Concurrent Clean Concurrent Clean [3], 6] 9] is a lazy functional programming language based on Term Graph Rewriting [2] Here is an example of a Clean function defining the well known fibonacci function. Fib INT INT; type definitions start with : Fib 1 1; Fib 2 1; Fib n (Fib ( n 1) Fib ( n 2) IF n 2 ....

Brus T, Eekelen van MCJD, Plasmeijer MJ and Barendregt HP. Clean - A Language for Functional Graph Rewriting. In: Proc. of Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, Springer Verlag, LNCS 274, 1987, pp. 364-384.

....concern in implementations of non strict functional languages. Not surprisingly, graph reduction [21] 19] 13] has been one of the popular ways of implementing functional languages, but it is only recently that people have investigated suitable calculii for graph rewriting [7] 8] and [9]. Contextual Rewriting Systems, which we introduce in Section 2, represent another formalism to capture the sharing of subexpressions. The idea of having a calculus that reflects what happens operationally in a sequential implementation goes back to the work of Plotkin [18] The core of Kid ....

T. Brus, M. van Eekelen, M. vam Leer, and M. Plasmeijer. Clean - A Language for Functional Graph Rewriting. In Proc. ACM Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon,Springer-Verlag LNCS 274, 1987.

....proceeds the divide and conquer processes are being distributed along the other elements. Load balancing is performed by all the ZAPP elements, but they are only permitted to offload tasks to their immediate neighbours. ZAPP is now [GMS91] being used to implement the language Concurrent Clean [BELP87], a graph rewriting language augmented with annotations for expressing parallelism. The system is called Concurrent Clean on ZAPP (CCOZ) and uses transputers to implement the ZAPP elements. Although the implementation is not complete, the results presented for popular benchmark programs are ....

Brus, T., Eekelen, M. C. J. D. van, Leer, M. van, Plasmeijer, M. J. "Clean - a language of functional graph rewriting". Lecture Notes in Computer Science 274, 1987, pp. 364-384.

No context found.

T. Brus, M. van Ecklen, M. Van Leer, and M. Plasmeijer. Clean A Language for Functional Graph Rewriting. In Kahn [Kah87], pages 364384.

No context found.

T. Brus, M.C.J.D. van Eekelen, M. van Leer and M.J. Plasmeijer, Clean - A Language for Functional Graph Rewriting. Proc. of the Third International Conf. for Functional Prog. Languages and Comp. Architectures (FPCA ' 87), Portland, Oregon, USA. Springer LNCS 274, 364-384. 1987.

.... functional programming language based on term graph rewriting (Barendregt, Eekelen, Glauert, Kennaway, Plasmeijer and Sleep (1987a) The first work on Clean started in 1984 in the Dutch Parallel Reduction Machine project (Barendregt, van Eekelen, Plasmeijer, Hartel, Hertzberger and Vree (1987) Brus et al. 1987)) in which the feasibility of the realization of a parallel reduction machine was investigated. The Nijmegen research focussed on the fundamentals of graph reduction and its implementation on sequential and parallel architectures. The fundamental idea is that graph reduction should not be ....

.... is based on GGRS s (Glauert et al. 1987) as well as the jointly with the University of East Anglia (UEA) defined language Lean (Barendregt, Eekelen, Glauert, Kennaway, Plasmeijer and Sleep (1987b) Barendregt et al. 1988) Based on restricted GGRS s the functional graph rewriting language Clean (Brus et al. 1987)) was developed as an intermediate language for the compilation of functional languages. Implementations (compilers and interpreters) of Clean (Brus et al. 1987) Nocker (1989) Smetsers (1989) have been developed as well as a Miranda to Clean conversion program (Koopman and Nocker (1988) ....

[Article contains additional citation context not shown here]

Brus, T., M.C.J.D. van Eekelen, M. van Leer, M.J. Plasmeijer and H.P. Barendregt (1987). Clean - a language for functional graph rewriting, Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '87), Portland, Oregon, USA, Springer Verlag, LNCS 274, pp. 364--384.

No context found.

Tom Brus, Marko van Eekelen, Maarten van Leer, Rinus Plasmeijer (1987). `CLEAN - A Language for Functional Graph Rewriting'. Proc. of the Third International Conference on Functional Programming Languages and Computer Architecture (FPCA '87), Portland, Oregon, USA, LNCS 274, Springer Verlag, 364-384.

....systems. It is shown that the functional strategy is normalizing for the class of left incompatible term rewriting systems. 1. Introduction An interesting common aspect of the functional languages Miranda 1 (Turner (1985) Haskell (Hudak et al. 1992) Lazy ML (Augustsson (1984) and Clean (Brus et al. 1987),Nocker et al. 1991) is the similarity between their reduction strategies. The reduction order determined by these strategies can roughly be characterized as topto bottom left to right lazy pattern matching. This reduction order, in the following referred to as the functional strategy, is ....

Brus, T., M.C.J.D. van Eekelen, M. van Leer, M.J. Plasmeijer and H.P. Barendregt (1987). Clean - a language for functional graph rewriting, Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '87), Portland, Oregon, USA, Springer Verlag, LNCS 274, pp. 364--384.

No context found.

T. Brus, M. C. J. D. van Eekelen, M. van Leer, M. J. Plasmeijer, and H. P. Barendregt. CLEAN --- a language for functional graph rewriting. In Kahn, editor, Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA'87), number 274 in LNCS, pages 364--384. Springer-Verlag, 1987.

No context found.

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. Clean: A Language for Functional Graph Rewriting. In Kahn. G. ed. Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364-384.

No context found.

Brus, T., Eekelen, M.C.J.D. van, Leer, M.O. van, and Plasmeijer, M.J. Clean: A Language for Functional Graph Rewriting. In Kahn. G. ed. Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364-384.

No context found.

T. Brus, M.C.J.D. van Eekelen, M. van Leer, M.J. Plasmeijer, and H.P. Barendregt. CLEAN - a language for functional graph rewriting. In G. Kahn, editor, Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '87), number 274 in Lecture Notes in Computer Science, pages 364--384. Springer-Verlag, 1987.

No context found.

T. Brus, M. van Eekelen, M. van Leer, M.J. Plasmeijer, and H.P. Barendregt. Clean -- a language for functional graph rewriting. In Proc. of the Third International Conf. for Functional Prog. Languages and Comp. Architectures (FPCA '87), Lecture Notes in Computer Science 274, pages 364--384. Springer-Verlag, 1987.

First 50 documents

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