Graph rewriting semantics for functional programming languages

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

Volumn 1258, Issue , 1997, Pages 106-128

  Van Eekelen, Marko ^a   Smetsers, Sjaak ^a   Plasmeijer, Rinus ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL MECHANICS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); PATTERN MATCHING; RECONFIGURABLE HARDWARE; SEMANTICS;

COMPUTATIONAL MODEL; DESIGN AND IMPLEMENTATIONS; EFFICIENT IMPLEMENTATION; FUNCTIONAL LANGUAGES; IMPERATIVE PROGRAMS; LAZY FUNCTIONAL LANGUAGES; REDUCTION PROPERTIES; TERM GRAPH REWRITING;

FUNCTIONAL PROGRAMMING;

EID: 84958771359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_35     Document Type: Conference Paper

References (23)

1. Ariola, Z.M. and J.W. Klop (1996). Equational Term Graph Gewriting, Fundamentae Informaticae, Vol. 26, Nrs. 3, 4, pp. 207-240.
2. Barendregt, H.P. (1984). The Lambda Calculus: Its Syntax and Semantics, Studies in Logic 103, second, revised edition, North-Holland, Amsterdam.
3. Barendregt, H.P., M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep (1987). Term graph reduction, in: J.W. de Bakker, A.J. Nijman and P.C. Treleaven (eds.), Proceedings of the Conference on Parallel Archi­tectures and Languages Europe (PARLE) II, Eindhoven, The Netherlands, Lecture Notes in Computer Science 259, Springer-Verlag, Berlin, pp. 141-158.
4. Barendsen, E. (1995). Types and Computations in Lambda Calculi and Graph Rewrite Systems, Dissertation, University of Nijmegen.
5. Barendsen, E. and J.E.W. Smetsers (1993). Conventional and uniqueness typing in graph rewrite systems (extended abstract), in: R.K. Shyamasundar (ed.), Pro­ceedings of the 13th Conference on Foundations of Software Technology and The­oretical Computer Science, Bombay, India, Lecture Notes in Computer Science 761, Springer-Verlag, Berlin, pp. 41-51. Full paper: see Technical Report CSI- R9328, University of Nijmegen, and Barendsen (1995).
6. Barendsen, E. and J.E.W. Smetsers (1994). Extending graph rewriting with copying, in: H.J. Schneider and H. Ehrig (eds.), Graph Transformations in Computer Science, International Workshop, Dagstuhl Castle, Germany, Lecture Notes in Computer Science 776, Springer-Verlag, Berlin, pp. 51-70.
7. Barendsen, E. and J.E.W. Smetsers (1996). Uniqueness typing for functional languages with graph rewriting semantics, Mathematical Structures in Computer Science, Vol. 6, pp. 579-612.
8. Brus, T., M.C.J.D. van Eekelen, M.O. van Leer and M.J. Plasmeijer (1987). Clean: A language for functional graph rewriting, Proceedings of the Conference on Func­tional Languages and Computer Architectures (FPCA), Portland, Oregon, Lecture Notes in Computer Science 274, Springer-Verlag, Berlin, pp. 364-384.
9. van Eekelen, M.C.J.D., M.J. Plasmeijer and J.E.W. Smetsers (1991). Parallel graph rewriting on loosely coupled machine architectures, in: Kaplan and Okada (eds.), Proc. of Conditional and Typed Rewriting Systems (CTRS’90), Montreal, Canada, Springer Verlag, LNCS 516, pp. 354-369.
10. Guzman, J.C. and P. Hudak (1990). Single-threaded polymorphic lambda calculus, Proceedings of the 5th Annual Symposium on Logic in Computer Science, Philadel­phia, IEEE Computer Society Press, pp. 333-343.
11. Hudak, P., P.L. Wadler, Arvind, B Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, T. Johnsson, R. Kieburtz, R.S. Nikhil, S.L. Peyton Jones, M. Reeve, D. Wise and J. Young (1990). Report on the functional programming language haskellTechnical report, Department of Computer Science, Glasgow University
12. Klop, J.W. (1992). Term rewrite systems, in: S. Abramsky, D.M. Gabbay and T.S.E. Maibaum (eds.), Handbook of Logic in Computer Science, Vol. II, Oxford Univer­sity Press.
13. Lamping, J. (1990). An algorithm for optimal lambda calculus reduction, Proc. of POPL’90: Seventeenth annual ACM symposium on Principles of Programming Languages, San Francisco, California, pp. 16-30.
14. Milner, R. (1984). A proposal for standard ML, Proceedings of the ACM Symposium on LISP and Functional Programming, Austin, pp. 184-197.
15. Nocker, E.G.J.M.H. (1993). Strictness analysis using abstract reduction, Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA ’93), Kopenhagen, ACM Press, pp. 255-265.
16. Nocker, E.G.J.M.H. and J.E.W. Smetsers (1993). Partially strict non-recursive data types, Journal of Functional Programming.
17. Nocker, E.G.J.M.H., J.E.W. Smetsers, M.C.J.D. van Eekelen and M.J. Plasmeijer (1991). Concurrent Clean, in: E.H.L. Aarts, J. van Leeuwen and M. Rem (eds.), Proceedings of the Conference on Parallel Architectures and Languages Europe (PARLE) II, Eindhoven, The Netherlands, Lecture Notes in Computer Science 505, Springer-Verlag, Berlin, pp. 202-219.
18. Plasmeijer, M.J. and M.C.J.D. van Eekelen (1993). Functional Programming and Par­allel Graph Rewriting, Addison-Wesley.Smetsers, J.E.W. (1993). Graph Rewriting and Functional Languages, Dissertation, University of Nijmegen.
19. Smetsers, J.E.W., E.G.J.M.H. Nocker, J.H.G. van Groningen and M.J. Plasmeijer (1991). Generating efficient code for lazy functional languages, Proc. of Confer­ence on Functional Programming Languages and Computer Architecture (FPCA ’91), Cambridge, MA, USA, Springer Verlag, LNCS 523, pp. 592-617.
20. Turner, D.A. (1985). Miranda: A non-strict functional language with polymorphic types, in: J.P. Jouannaud (ed.), Proceedings of the Conference on Functional Languages and Computer Architectures (FPCA), Nancy, Prance, Lecture Notes in Computer Science 201, Springer-Verlag, Berlin, pp. 1-16.
21. Turner, D.N., P. Wadler and C. Mossin (1995). Once upon a type, Proceedings of the Conference on Functional Languages and Computer Architectures (FPCA), La Jolla, California, ACM Press, pp. 1-11.
22. Wadler, P. (1990). Linear types can change the world!, Proceedings of the Work­ing Conference on Programming Concepts and Methods, Israel, North-Holland, Amsterdam, pp. 385-407.
23. Wadsworth, C.P. (1971). Semantics and Pragmatics of the Lambda Calculus, Disser­tation, Oxford University.