Rinus Plasmeijer
Marko van Eekelen
- Achten, P. M., and Plasmeijer, M. J. (1995). The ins and outs of CLEAN I/O. J. Functional Programming, 5(1):81--110.Google Scholar
Cross Ref
- Achten, P. M. (1996). Interactive Functional Programs - models, methods, and implementations. Ph.D., University of Nijmegen.Google Scholar
- Achten, P., and Plasmeijer, R. (1997). Interactive Functional Objects in CLEAN. In Proc. 1997 Workshop on the Implementation of Functional Languages (IFL'97). (Hammond, K., Davie, T., and Clack, C. eds.), St. Andrews, Scotland. pp. 387--406. A revised version will appear in the proceedings, LNCS 1467, Springer Verlag. Google Scholar
- Armstrong, J., Virding, R., Williams, M. (1993). Concurrent Programming in ERLANG. Prentice Hall. Google ScholarDigital Library
- Barendregt, H. P. (1984). The Lambda Calculus - Its Syntax and Semantics (revised edition). Studies in Logic and the Foundations of Mathematics 103. Elsevier Science Publishers 1984.Google Scholar
- Barendregt, H. P., Eekelen van, M. C. J. D., Glauert, J. R. W., Kennaway, J. R., Plasmeijer, M. J., and Sleep, M. R. (1987). Term Graph Rewriting. In Bakker, J. W. de, Nijman, A. J., and Treleaven, P. C. eds. Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, LNCS 259, Vol. II. Springer-Verlag, Berlin, pp. 141--158. Google ScholarDigital Library
- Barendsen, E., and Smetsers, J. E. W. (1993). Extending Graph Rewriting with Copying. In: Graph Transformations in Computer Science, ed. B. Courcelle, H. Ehrig, G. Rozenberg and H. J. Schneider, Dagstuhl, Wadern, Springer-Verlag, Berlin, LNCS 776, Springer Verlag, pp. 51--70. Google Scholar
- Barendsen, E., and Smetsers, S. (1996). Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science, 6:579--612.Google ScholarCross Ref
- 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., ed. Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, LNCS 274, Springer-Verlag, pp. 364--384. Google ScholarDigital Library
- Harper, R., MacQueen, D., and Milner, R. (1986). Standard ML. Edinburgh University, Internal report ECS-LFCS-86-2.Google Scholar
- Harvey, B. and Wright, M. (1994). Simply Scheme. MIT Press.Google Scholar
- Hoon, W. A. C. A. J. de, Rutten, L. M. W. J., and Eekelen, M. C. J. D. van (1995). Implementing a Functional Spreadsheet in CLEAN. J. Functional Programming, 5(3):383--414, July.Google ScholarCross Ref
- Hudak, P., Peyton Jones, S., Wadler, P., et al., (1992). Report on the Programming Language HASKELL. ACM SigPlan Notices27, (5), pp. 1--164. Google ScholarDigital Library
- Girard, J.-Y. (1987). Linear Logic. Theoretical Computer Science, 50: 1--102, 1987. Google ScholarDigital Library
- Groningen, J. H. G. van (1996). The Implementation and Efficiency of Arrays in CLEAN 1.1. In Kluge, W., ed. Implementation of Functional Languages (Selected papers of 8th International Workshop, IFL96, Bad Godesberg, Germany). LNCS 1268, pp. 105--124. Springer Verlag. Google ScholarDigital Library
- Jones, M. P. (1995). A system of constructor classes: overloading and implicit higher-order polymorphism, J. Functional Programming, 5(1):1--37, January.Google ScholarCross Ref
- Kesseler, M. H. G. (1996). The Implementation of Functional Languages on Parallel Machines with Distributed Memory. Ph.D. Thesis. Nijmegen Univ.Google Scholar
- Leroy, X. (1995). La systeme CAML Special Light: modules et compilation efficace en CAML Research Report 2721, INRIA, November.Google Scholar
- McCarthy J. (1960). Recursive functions of symbolic expressions and their computation by machine. Comm ACM, 4:184--195. Google ScholarDigital Library
- Nöcker, E. G. J. M. H., Smetsers, J. E. W., Eekelen, M. C. J. D. van, and Plasmeijer, M. J. (1991). Concurrent CLEAN. In Aarts, E. H. L., et al., eds, Parallel Architectures and Languages Europe, June, Eindhoven, The Netherlands. LNCS 506, Springer-Verlag, pp. 202--219. Google Scholar
- Pil, M. (1996). First Class File I/O. In Kluge, W., ed. Implementation of Functional Languages (Selected papers of 8th International Workshop, IFL96, Bad Godesberg, Germany). LNCS 1268, pp. 233--246. Springer Verlag. Google ScholarDigital Library
- Plasmeijer, M. J. and van Eekelen, M. C. J. D. (1993). Functional Programming and Parallel Graph Rewriting. Addison-Wesley. Google ScholarDigital Library
- Plasmeijer, M. J. and van Eekelen, M. C. J. D. (1997). CLEAN 1.2 Language Report. Technical Report, www.cs.kun.nl/~clean. Nijmegen.Google Scholar
- Turner, D. A. (1985). MIRANDA: a non-strict functional language with polymorphic types. In Functional Programming Languages and Computer Architecture, Nancy, France (Jouannaud, J. P., ed.), LNCS 201, pp. 1--16. Berlin: Springer-Verlag. Google Scholar
- Wadler, Ph. (1997). How to Declare an Imperative. ACM Computing Surveys, 29(3):240--263. Google ScholarDigital Library
Index Terms
- Keep it clean: a unique approach to functional programming.
Index terms have been assigned to the content through auto-classification.
Recommendations
Introduction to programming Using Clean
ITiCSE 2023: Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 2In this poster, we report our on-going project that aims to design a good set of course materials for introduction to programming using a functional programming language, Clean[2]. While procedural languages such as C, Python, etc are used in most ...
Should LOGO keep going forward 1?
LOGO has been evolving in incremental steps for 40 years. This has resulted in steady progress but some regions of the space of all programming languages for children cannot be reached without passing through unacceptable intermediate designs. What are ...
Comments