Revision as of 10:07, 8 June 2015

If you encounter problems, please send an e-mail to clean@cs.ru.nl. Some of the older papers and PhD Theses are not available electronically. If you like to have a copy by surface-mail you are also invited to send an e-mail. The authors can of course also be contacted personally.

Pieter Koopman, Peter Achten and Rinus Plasmeijer. Model Based Testing with Logical Properties versus State Machines. In A. Gill and J. Hage, Eds. Revised Selected Papers of the International Symposium on the Implementation and Application of Functional Languages, IFL 2011, The University of Texas, October 2011, Springer-Verlag, LNCS 7257, pp. 116-133.

Marco Pil. Dynamic Types and Type Dependent Functions, in Proc. of the 10th International Workshop on Implementation of Functional Languages (IFL'98), London, 1998, pp. 65-84. A revised version will also appear in Springers LNCS.

Pieter Koopman, Rinus Plasmeijer. Efficient Combinators Parser, in Proc. of the 10th International Workshop on Implementation of Functional Languages (IFL'98), London, 1998, pp. ??-??. A revised version will also appear in Springers LNCS.

Pascal Serrarens, Rinus Plasmeijer. Explicit Message Passing for Concurrent Clean, in Proc. of the 10th International Workshop on Implementation of Functional Languages (IFL'98), K. Hammond, A.J.T. Davie and C.Clack, editors, London, 1998, pp. 289-308. A revised version will also appear in Springers LNCS.

Achten, P. The GUI-fest challenges. During the GUI-fest in Glasgow some challenges for GUI solutions in a functional languages have been defined. In this report a solution is given using CLEAN. (abstract)

Achten, P. and R. Plasmeijer. Concurrent Interactive Processes in a Pure Functional Language, In Proc. of Computing Science in the Netherlands (CSN '95), Utrecht, van Vliet Ed., Stichting Mathematisch Centrum, pp. 10-21. The paper describes how the interleaved CLEAN I/O system model (multiple interactive processes on one machine) can be extended into a distributed system.(abstract)

Achten, P.M. and M.J. Plasmeijer. The Ins and Outs of Concurrent CLEAN I/O, In Journal of Functional Programming 5:1, pp. 81-110. Explains the concepts behind CLEANs' Event I/O and how this can be used to define platform independent interactive window-based applications on a high level of abstraction.(abstract)

Serrarens, Pascal R. BriX - A Deterministic Concurrent Functional X Windows System , MSc thesis, University of Amsterdam. This thesis describes the development and workings of BriX, in which special efforts were taken to avoid non-determinism, using just deterministic techniques.

Kesseler, M. Lazy Copying and Uniqueness, In Proc. of 6th International Workshop on the Implementation of Functional Languages, UEA, Norwich,UK, Glauert Ed., pp. 4.1-4.11. The Uniqueness type system and lazy graph copying are important techniques to efficiently implement functional languages. Unfortunately, combination of both in one system may lead to conflicts. Until recently, parallel Concurrent CLEAN programs could not take advantage of the uniqueness type system, because the lazy graph copying method that Concurrent CLEAN employed was able to invalidate derived uniqueness information. This paper will address this problem and present a solution that is based on a new copying method with different semantics, called lazy normal form copying. (abstract)

Barendsen, E. and J.E.W. Smetsers (1993), Extending Graph Rewriting with Copying, In Proc. of Seminar on Graph Transformations in Computer Science, Dagstuhl, Wadern, Courcelle, Ehrig, Rozenberg and Schneider Eds., Springer-Verlag, LNCS 776, pp. 51-70. A full version of the paper is available as a technical report. Formal semantics of (lazy) copying. (abstract)

Barendsen, Erik and Sjaak Smetsers, Conventional and Uniqueness Typing in Graph Rewrite Systems (extended abstract), In Proc. of 13th Conference on the Foundations of Software Technology & Theoretical Computer Science (FST&TCS13), Bombay, India, Shyamasundar Ed., Springer-Verlag, LNCS 761, pp. 41-51. A full version of this paper is available as a technical report. Formal treatment of CLEANs' uniqueness type system used to guarantee single-threaded use of objects. (abstract)

Eekelen, M.C.J.D van and M.J. Plasmeijer, Process Annotations and Process Types, In Term Graph Rewriting - Theory and Practice, Sleep, Plasmeijer and Eekelen Eds., John Wiley & Sons, pp. 347-362. The concurrent behaviour of a program is defined by means of annotations with an associated type system. (abstract)

Smetsers, Sjaak. Term Graph Rewriting and Strong Sequentiality, In Proc. of Computing Science in the Netherlands (CSN'92), Utrecht, the Netherlands, Dietz Ed., SMC, Amsterdam, pp. 291-303. Investigates the notion of strong sequentiality in the context of Term Graph Rewriting. (abstract)

1991

Achten, P.M.. Annotations for load distribution, In Proc. of 3rd Int. Workshop on the Implementation of Functional Languages on Parallel Architectures, Southampton, Glaser and Hartel Eds., University of Southampton, CTRS 91-07, pp. 247-265. Extended abstract of Master's thesis. Describes a set of load distribution primitives to annotate Concurrent CLEAN program.

Nöcker, E.G.J.M.H. Strictness Analysis based on Abstract Reduction, In Proc. of Second International Workshop on Implementation of Functional Languages on Parallel Architectures, University of Nijmegen, the Netherlands, Technical Report 90-16, pp. 297-321.

Nöcker, E.G.J.M.H. and J.E.W. Smetsers. Partially Strict Data Types, In Proc. of Second International Workshop on Implementation of Functional Languages on Parallel Architectures, University of Nijmegen, the Netherlands, Technical Report 90-16, pp. 147-192.

Nöcker, E.G.J.M.H. Strictness Analysis based on Abstract Reduction of Term Graph Rewrite Systems, In Proc. of Workshop on Implementation of Lazy Functional Languages, Göteborg, Johnsson, Peyton Jones and Karlsson Eds., University of Göteborg and Chalmers University of Technology, Programming Methodology Group Report 53, pp. 451-462.

Eekelen, M.C.J.D., van, Barendregt H.P., Glauert J.R.W., Kennaway J.R., Plasmeijer M.J. and Sleep M.R. Term Graph Rewriting, Department of Computer Science, University of Nijmegen Internal Report 87. Also as Report SYS-C87-01, School of Information Systems, University of East Anglia.

Nöcker, E.G.J.M. and M.J. Plasmeijer. Combinator reduction on a parallel G-machine, In Proc. of International Conference on Parallel Processing and Applications, Aquila, Italy, Chiricozzi and D'Amico Eds., North Holland, pp. 399-412.

Plasmeijer, M.J. and M.C.J.D. van Eekelen. Modules as First-Class Citizens in the Context of Functional Programming, University of Nijmegen, Technical Report 86.

1986

Eekelen, M.C.J.D, van and Plasmeijer M.J. Specification of reduction strategies in term rewriting systems, In Proc. of Int. Workshop on Graph Reduction, Santa Fe, NM, Fasel and Keller Eds., Springer-Verlag, LNCS 279, pp. 215-239. (abstract)In this paper three formal methods for specifying reduction strategies in TRS's are presented. In the first method the reduction strategy is encoded in the TRS itself. In the second method a priority TRS is used as annotation TRS. In the third metho three separate TRS's are used. The use of this abstract-interpretation TRS is shown to be the most promising method.