Appendix C

Bibliography

You can find all our papers on our site:http://wiki.clean.cs.ru.nl/Publications

Peter Achten, John van Groningen and Rinus Plasmeijer (1992). ‘High-level specification of I/O in functional languages’. In: Proc. of the Glasgow workshop on Functional programming, ed. J. Lau­nchbury and P. Sansom, Ayr, Scotland, Springer-Verlag, Workshops in Comput­ing, pp. 1-17.

Peter Achten and Rinus Plasmeijer (1995). ‘The Ins and Outs of Concurrent Clean I/O’. Jour­nal of Functional Programming, 5, 1, pp. 81-110.

Peter Achten and Rinus Plasmeijer (1997). “Interactive Functional Objects in Clean”. In: Proc. of the 1997 Workshop on the Implementation of Functional Languages (IFL’97), ed. K. Hammond Davie, T., and Clack, C., St.Andrews, Scotland, pp. 387-406.

Artem Alimarine and Rinus Plasmeijer. A Generic Programming Extension for Clean. In: Arts, Th., Mohnen, M. eds. Proceedings of the 13th International workshop on the Implementation of Functional Languages, IFL'01, Älvsjö, Sweden, September 24-26, 2001, Ericsson Computer Science Laboratory, pp.257-278.

Tom Brus, Marko van Eekelen, Maarten van Leer, Rinus Plasmeijer (1987). ‘Clean - A Lan­guage for Functional Graph Rewriting’. Proc. of the Third International Conference on Func­tio­nal Pro­gramming Languages and Computer Architecture (FPCA ‘87), Portland, Oregon, USA, LNCS 274, Springer Verlag, 364-384.

Barendregt, H.P. (1984). The Lambda-Calculus, its Syntax and Semantics. North–Holland.

Henk Barendregt, Marko van Eekelen, John Glauert, Richard Kennaway, Rinus Plasmeijer, Ro­nan Sleep (1987). ‘Term Graph Rewriting’. Proceedings of Parallel Architectures and Lan­guages Eu­rope (PARLE), part II, Eindhoven, The Netherlands. LNCS 259, Springer Verlag, 141-158.

Erik Barendsen and Sjaak Smetsers (1993a). ‘Extending Graph Rewriting with Copying’. In: Proc. of the Seminar on Graph Transformations in Computer Science, ed. B. Courcelle, H. Ehrig, G. Ro­zenberg and H.J. Schneider, Dagstuhl, Wadern, Springer-Verlag, Berlin, LNCS 776, Springer Verlag, pp 51-70.

Erik Barendsen and Sjaak Smetsers (1993b). ‘Conventional and Uniqueness Typing in Graph Rewrite Systems (extended abstract)’. In: Proc. of the 13th Conference on the Foundations of Soft­ware Technology & Theoretical Computer Science, ed. R.K. Shyamasundar, Bombay, India, LNCS 761, Springer Verlag, pp. 41-51.

Bird, R.S. and P. Wadler (1988). Introduction to Functional Programming. Prentice Hall.

Marko van Eekelen, Rinus Plasmeijer, Sjaak Smetsers (1991). ‘Parallel Graph Rewriting on Loo­sely Coupled Machine Architectures’. In Kaplan, S. and M. Okada (Eds.) Proc. of the 2nd Int. Worksh. on Conditional and Typed Rewriting Systems (CTRS’90), 1990. Montreal, Ca­nada, LNCS 516, Springer Verlag, 354-370.

Eekelen, M.C.J.D. van, J.W.M. Smetsers, M.J. Plasmeijer (1997). “Graph Rewriting Semantics for Functional Programming Languages”. In: Proc. of the CSL ‘96, Fifth Annual conference of the European Association for Computer Science Logic (EACSL), ed. Marc Bezem Dirk van Dalen, Utrecht, Springer-Verlag, LNCS, 1258, pp. 106-128.

Harper, R., D. MacQueen and R. Milner (1986). ‘Standard ML’. Edinburgh University, Internal re­port ECS-LFCS-86-2.

Hindley R. (1969). The principle type scheme of an object in combinatory logic. Trans. of the Ameri­can Math. Soc., 146, 29-60.

Hudak, P. , S. Peyton Jones, Ph. Wadler, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hug­hes, Th. Johnsson, D. Kieburtz, R. Nikhil, W. Partain and J. Peterson (1992). ‘Report on the pro­gram­ming language Haskell’. ACM SigPlan notices, 27, 5, pp. 1-164.

John van Groningen and Rinus Plasmeijer. Strict and unboxed lists using type constructor classes in a lazy functional language. Presented at the 13th International Workshop on the Implementation of Functional Languages, IFL 2001, Älvsjö, Sweden, September 24-26, 2001, Ericsson Computer Science Laboratory.

Jones, M.P. (1993). Gofer - Gofer 2.21 release notes. Yale University.

Marko Kesseler (1991). ‘Implementing the ABC machine on transputers’. In: Proc. of the 3rd In­ter­national Workshop on Implementation of Functional Languages on Parallel Architectures, ed. H. Glaser and P. Hartel, Southampton, University of Southampton, Technical Report 91-07, pp. 147-192.

Kesseler, M.H.G. (1996). The Implementation of Functional Languages on Parallel Machines with Distributed Memory. Ph.D., University of Nijmegen.

Milner, R.A. (1978). ‘Theory of type polymorphism in programming’. Journal of Computer and Sys­tem Sciences, 17, 3, 348-375.

Mycroft A. (1984). Polymorphic type schemes and recursive defini­tions. In Proc. International Con­fe­r­ence on Programming, Toulouse (Paul M. and Robinet B., eds.), LNCS 167, Springer Ver­lag, 217–239.

Eric Nöcker, Sjaak Smetsers, Marko van Eekelen, Rinus Plasmeijer (1991). ‘Concurrent Clean’. In Aarts, E.H.L., J. van Leeuwen, M. Rem (Eds.), Proceedings of the Conference on Paral­lel Archi­tectures and Languages Europe (PARLE’91), Vol II, Eindhoven, The Nether­lands, LNCS 505, Springer Verlag, June 1991, 202-219.

Eric Nöcker (1993). ‘Strictness analysis using abstract reduction’. In: Proc. of the 6th Confe­r­ence on Functional Programming Languages and Computer Architectures, ed. Arvind, Copen­hagen, ACM Press, pp. 255-265.

Eric Nöcker and Sjaak Smetsers (1993). ‘Partially strict non-recursive data types’. Journal of Functional Programming, 3, 2, pp. 191-215.

Pil, M.R.C. (1999), Dynamic  types and type dependent functions , In Proc. of Implementation of Functional Languages (IFL  '98), London, U.K., Hammond, Davie and  Clack Eds.,  Springer-Verlag, Berlin, Lecture Notes in Computer Science 1595,  pp 169-185.

Rinus Plasmeijer and Marko van Eekelen (1993). Functional Programming and Parallel Graph Rewriting. Addison Wesley, ISBN 0-201-41663-8.

Sjaak Smetsers, Eric Nöcker, John van Groningen, Rinus Plasmeijer (1991). ‘Generating Ef­fi­cient Code for Lazy Functional Languages’. In Hughes, J. (Ed.), Proc. of the Fifth Interna­tional Confer­ence on Functional Programming Languages and Computer Architecture (FPCA ‘91), USA, LNCS 523, Springer Verlag, 592-618.

Ronan Sleep, Rinus Plasmeijer and Marko van Eekelen (1993). Term Graph Rewriting - The­ory and Practice. John Wiley & Sons.

Yoshihito Toyama, Sjaak Smetsers, Marko van Eekelen and Rinus Plasmeijer (1993). ‘The func­tional strat­egy and transitive term rewriting systems’. In: Term Graph Rewriting, ed. Sleep, Plas­meijer and van Eekelen, John Wiley.

Turner, D.A. (1985). ‘Miranda: a non-strict functional language with polymorphic types’. In: Proc. of the Conference on Functional Programming Languages and Computer Architecture, ed. J.P. Jouan­naud, Nancy, France. LNCS 201, Springer Verlag, 1-16.

Martijn Vervoort and Rinus Plasmeijer (2002). Lazy Dynamic Input/Output in the lazy functional language Clean - early draft -. In: Peña, R. ed. Proceedings of the 14th International Workshop on the Implementation of Functional Languages, IFL 2002, Madrid, Spain, September 16-18, 2002, Technical Report 127-02, Departamento de Sistemas Informáticos y Programació n, Universidad Complutense de Madrid, pages 404-408.

Arjen van Weelden and Rinus Plasmeijer (2002). Towards a Strongly Typed Functional Operating System. In: Peña, R. ed. Proceedings of the 14th International Workshop on the Implementation of Functional Languages, IFL 2002, Madrid, Spain, September 16-18, 2002, Technical Report 127-02, Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, pages 301-319.