R. Plasmeijer and M. van Eekelen. Concurrent Clean Language Report version 2.1. University of Nijmegen, November 2002. http://cs.kun.nl/#clean. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Functions, Frames, and Interactions - completing a.. - Reinke (1998) (Correct)
....as the new approach to input output in purely functional languages. After a period of unofficial extensions to Haskell implementations, the Haskell specification switched to monadic input output as the basic scheme with version 1.3 of the Haskell report [PH96] in 1996. Independently, the Clean [PvE97] group adopted an environment passing style for input output. This was made feasible by Clean s static uniqueness type inference system [BS95] which allows to check the single threaded use of environments statically. The approach is described in Achten s PhD thesis [Ach96] where several ....
....comprehensible modules. The separation between these program parts is established via explicit control over the visibility of identifiers defined inside the parts. This view of module systems can of course be adopted for functional languages and this has been done, e.g. for the languages Clean [PvE97, version 1.2] and Haskell [PH96, version 1.3] Both define programs to be collections of modules which are themselves collections of definitions, declarations and explicit references to other modules via import declarations. In Clean, interfaces and implementations have to be provided in separate ....
[Article contains additional citation context not shown here]
Rinus Plasmeijer and Marko van Eekelen. The Concurrent Clean Language Report -- version 1.2 (draft). Technical report, HILT -- High Level Software Tools B.V. and University of Nijmegen, March 1997.
On Functional Programming, Language Design, and Persistence - Reinke (1998) (Correct)
.... to the so called imperative functional programming style in Haskell [PJW93] Also, the search for more expressive type systems has led to programming environments in which it is almost impossible to disentangle the functional programming language from the type language (cf. Haskell [Has96] Clean [PvE97] or Standard ML [MTH90, MT91] Type systems are increasingly being used for meta programming over a functional object language. In general, current languages consist of several tightly integrated parts and make it difficult to attribute perceived advantages to any isolated part of the language, ....
Rinus Plasmeijer and Marko van Eekelen. The Concurrent Clean Language Report -- version 1.2 (draft). Technical report, HILT -- High Level Software Tools B.V. and University of Nijmegen, March 1997.
A Functional Shell That Operates on Typed and Compiled.. - Plasmeijer, van Weelden (2005) Self-citation (Plasmeijer) (Correct)
No context found.
R. Plasmeijer and M. van Eekelen. Concurrent Clean Language Report version 2.1. University of Nijmegen, November 2002. http://cs.kun.nl/#clean.
A Functional Shell That Dynamically Combines Compiled Code - van Weelden, Plasmeijer (2004) Self-citation (Plasmeijer) (Correct)
No context found.
Rinus Plasmeijer and Marko van Eekelen. Concurrent Clean Language Report version 2.1. University of Nijmegen, November 2002. http://cs.kun.nl/#clean.
A Functional Shell that Dynamically Combines Compiled Code - van Weelden, Plasmeijer (2004) Self-citation (Plasmeijer) (Correct)
No context found.
Rinus Plasmeijer and Marko van Eekelen. Concurrent Clean Language Report version 2.1. University of Nijmegen, November 2002. http://cs.kun.nl/#clean.
A Functional Shell that Dynamically Combines Compiled Code - van Weelden, Plasmeijer (2003) Self-citation (Plasmeijer) (Correct)
No context found.
Rinus Plasmeijer and Marko van Eekelen. Concurrent Clean Language Report version 2.1. University of Nijmegen, November 2002. http://cs.kun.nl/#clean.
Polygonizing Implicit Surfaces in a Purely Functional Way - Zörner, Koopman, van.. Self-citation (Plasmeijer Van eekelen) (Correct)
....way is continued recursively for all cubes that intersect with the surface, till a prescribed depth is reached. Then the zeros on the edges of a cube are calculated and connected to polygons. We implement this algorithm in a purely functional way in the pure and lazy functional language Clean [13]. We obtain code that is much shorter than a comparable public domain implementation [3] in C. Due to lazy evaluation the space consumption of the program is minimal, but execution time of the Clean code is higher than that of the C code. We claim that our program can easily be understood and be ....
....a proper visualization, as all neighboring polygons share entire edges rather than just nodes with their neighbors. Fig. 4. Cube cut into six tetrahedra 4 The Clean Implementation We assume basic knowledge of functional languages and in particular on the pure and lazy functional language Clean [13]. As we work in Euclidean space we base all geometric information on three dimensional vectors. We prefer an algebraic data type instead of an array, for the ease of access. There are only three elements within the vector, one for each coordinate direction, of type Real. Vector3 = Vector3 ....
Rinus Plasmeijer, Marko van Eekelen. Concurrent Clean Language Report - version
Plugging Haskell In - Pang, Stewart, Seefried, Chakravarty (Correct)
No context found.
Rinus Plasmeijer and Marko van Eekelen. Concurrent clean language report version 2.1. November 2002.
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