Concurrent clean

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 506 LNCS, Issue , 1991, Pages 202-219

  Nocker E G J M H ^a   Smetsers, J E W ^a   van Eekelen, M C J D ^a   Plasmeijer, M J ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL PROGRAMMING; PARALLEL ARCHITECTURES;

CONTROL COMMUNICATIONS; CYCLIC STRUCTURES; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; LAZY FUNCTIONAL LANGUAGES; PARALLEL IMPLEMENTATIONS; PROCESS TOPOLOGY; TERM GRAPH REWRITING;

CONCURRENCY CONTROL;

EID: 85035779792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54152-7_66     Document Type: Conference Paper

References (29)

1. Augustsson L., Johnsson T. (1989), “The Chalmers Lazy-ML Compiler’, The Computer Journal, Vol. 32, No. 2 1989.
2. Barendregt, H.P., Eekelen, M.C.J.D. van, Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R., (1987a), ‘Term Graph Reduction’, Proceedings of Parallel Architectures and Languages Europe (PARLE), part II, Eindhoven, The Netherlands, LNCS Vol. 259, pp. 141-158, June 1987.
3. Barendregt, H.P., Eekelen, M.C.J.D. van, Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R., (1987b). Towards an Intermediate Language based on Graph Rewriting. Proceedings of Parallel Architectures and Languages Europe (PARLE), part II, Eindhoven, The Netherlands. Springer Lec. Notes Comp. Sci, 259,159-175.
4. Barendregt, HP., Eekelen, M.C.J.D. van, Plasmeijer, MJ., Hartel, P.H., Hertzberger, L.O., Vree, W.G., (1987), “The Dutch Parallel Reduction Machine Project’, Intern. Conf. on Frontiers in Computing, Amsterdam, Dec. 1987.
5. Barendregt, H.P., Eekelen, M.CJ.D. van, Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R. (1988). ‘Towards an Intermediate Language based on Graph Rewriting’. Revised version. Journal of Parallel Computing 9 with selected papers of the conference on Parallel Architectures and Languages Europe (PARLE), Eindhoven, The Netherlands. North-Holland 163-177.
6. Brus, T., Eekelen, M.CJ.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 Lec. Notes on Comp.Sci. 274, 364 - 384.
7. Burstall, R.M., MacQueen, D.B., and Sanella, D.T. (1980). Hope: An Experimental Applicative Language. Proceedings of the 1980 LISP Conference, 136 - 143.
8. Eekelen, M.CJ.D. van, (1988). Parallel Graph Rewriting, Some Contributions to its Theory, its Implementation and its Application. University of Nijmegen. Ph.D. Thesis.
9. Eekelen, M.CJ.D. van, Plasmeijer, M.J., Smetsers, J.E.W., (1989b). Communicating Functional Processes. University of Nijmegen. Technical Report 89-3.
10. Eekelen M.CJ.D. van, Nöcker E.G.J.M.H., Plasmeijer M.J., Smetsers J.E.W., (1990). ‘Concurrent Clean, version 0.6', Technical Report 90-21, University of Nijmegen, December 1990.
11. Eekelen, M.C.J.D. van, Plasmeijer, M.J., Smetsers, J.E.W., (1991). Parallel Graph Rewriting on Loosely Coupled Machine Architectures’ proceedings of the workshop on CTRS’90. Montreal Canada. To appear in 1991.
12. Eekelen, M.C.J.D. van, Plasmeijer, M.J., (1990). ‘Concurrent Functional Programming’. Proceedings of the conference on Unix & Parallelism, NLUUG, may 1990, pp 75-98.
13. Glauert, J.R.W., Kennaway, J.R., Sleep, M.R., (1987), ‘DACTL: A Computational Model and Compiler Target Language Based on Graph Reduction’, ICL Technical Journal, May 1987.
14. Groningen J. van. (1990). ‘Implementing the ABC-machine on M680x0 based architectures’. Master Thesis, University of Nijmegen, November 1990.
15. Johnsson Th. (1987). ‘Compiling Lazy Functional Programming languages’. Dissertation at Chalmers University, Gdtenborg, Sweden. ISBN 91-7032-280-5.
16. Kesseler M., (1990), ‘Concurrent Clean on Transputers’, Master Thesis, University of Nijmegen, November 1990.
17. Koopman, P.W.M., Nocker, E.GJ.M.H. (1988), ‘Compiling functional languages to Term Graph Rewriting Systems’. Technical Report 88-1, University of Nijmegen.
18. Koopman P.W.M., Eekelen M.C.J.D. van, Nocker E.GJ.M.H., Smetsers S., Plasmeijer M.J. (1990). ‘The ABC-machine: A Sequential Stack-based Abstract Machine For Graph Rewriting’. Technical Report, University of Nijmegen.
19. McBurney, D, Sleep, R. (1990), ‘Concurrent Clean on Zapp’, Proceedings of the Second International Workshop on Implementations of Functional Languages on Distributed Architectures, University of Nijmegen, November 1990.
20. Milner, R.A. (1978). Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, Vol. 17, no. 3, 348 - 375.
21. Mycroft, A. (1984). Polymorphic type schemes and recursive definitions. Proc. of the 6th Int. Conf. on Programming, Springer Lec. Notes Comp. Sci. 167, 217 - 228.
22. Nöcker E.GJ.M.H., (1989). “The PABC Simulator, v0.5. Implementation Manual’. University of Nijmegen, Technical Report 89-19.
23. Nöcker E.G.J.M.H. (1990). ‘Strictness Analysis based on Abstract Reduction’, in Proceedings of the Second International Workshop on Implementation of Functional Languages on Parallel Architectures, pp. 297-321, Technical Report no. 90-16, October 1990, University of Nijmegen.
24. Nöcker E.GJ.M.H., Smetsers J.E.W., (1990). ‘Partially Strict Data Types’, Proceedings of the Second International Workshop on Implementations of Functional Languages on Distributed Architectures, University of Nijmegen, November 1990.
25. Peyton Jones S.L, Salkild J. (1989). “The Spineless Tagless G-machine’. Proceedings of the Conference on Functional Programming Languages and Computer Architectures, Addison Wesley, pp 184 - 201.
26. Plasmeijer, M.J., Eekelen, M.CJ.D. van (1989). Functional Programming and Parallel Graph Rewriting. Lecture notes, University of Nijmegen, to appear at Addison Wesley 1991.
27. Smetsers J.E.W., (1989). ‘Compiling Clean to Abstract ABC-Machine Code*. University of Nijmegen, Technical Report 89-20.
28. Smetsers, J.E.W., Eekelen, M.C.J.D. van, Plasmeijer, M.J., (1991). Operational semantics of Concurrent Clean. University of Nijmegen. Technical Report: in preparation.
29. Turner D.A. (1985), ‘Miranda: A non-strict functional language with polymorphic types’. Proc. of the conference on Functional Programming Languages and Computer Architecture, Springer Lec. Notes Comp. Sci. 201,1 -16.