{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299691},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631729"},{"type":"electronic","value":"9783540692010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63172-0_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:16:40Z","timestamp":1330298200000},"page":"106-128","source":"Crossref","is-referenced-by-count":3,"title":["Graph rewriting semantics for functional programming languages"],"prefix":"10.1007","author":[{"given":"Marko","family":"Eekelen","sequence":"first","affiliation":[]},{"given":"Sjaak","family":"Smetsers","sequence":"additional","affiliation":[]},{"given":"Rinus","family":"Plasmeijer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"Nrs.3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Ariola, Z.M. and J.W. Klop (1996). Equational Term Graph Gewriting, Fundamentae Informaticae, Vol. 26, Nrs. 3, 4, pp. 207\u2013240.","journal-title":"Fundamentae Informaticae"},{"key":"7_CR2","volume-title":"Studies in Logic 103","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P. (1984). The Lambda Calculus: Its Syntax and Semantics, Studies in Logic 103, second, revised edition, North-Holland, Amsterdam.","edition":"second, revised"},{"key":"7_CR3","first-page":"141","volume-title":"Lecture Notes in Computer Science 259","author":"H.P. Barendregt","year":"1987","unstructured":"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 Architectures and Languages Europe (PARLE) II, Eindhoven, The Netherlands, Lecture Notes in Computer Science 259, Springer-Verlag, Berlin, pp. 141\u2013158."},{"key":"7_CR4","unstructured":"Barendsen, E. (1995). Types and Computations in Lambda Calculi and Graph Rewrite Systems, Dissertation, University of Nijmegen."},{"key":"7_CR5","first-page":"41","volume-title":"Lecture Notes in Computer Science 761","author":"E. Barendsen","year":"1993","unstructured":"Barendsen, E. and J.E.W. Smetsers (1993). Conventional and uniqueness typing in graph rewrite systems (extended abstract), in: R.K. Shyamasundar (ed.), Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India, Lecture Notes in Computer Science 761, Springer-Verlag, Berlin, pp. 41\u201351. Full paper: see Technical Report CSI-R9328, University of Nijmegen, and Barendsen (1995)."},{"key":"7_CR6","first-page":"51","volume-title":"Lecture Notes in Computer Science 776","author":"E. Barendsen","year":"1994","unstructured":"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\u201370."},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0960129500070109","volume":"6","author":"E. Barendsen","year":"1996","unstructured":"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\u2013612.","journal-title":"Mathematical Structures in Computer Science"},{"key":"7_CR8","first-page":"364","volume-title":"Lecture Notes in Computer Science 274","author":"T. Brus","year":"1987","unstructured":"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 Functional Languages and Computer Architectures (FPCA), Portland, Oregon, Lecture Notes in Computer Science 274, Springer-Verlag, Berlin, pp. 364\u2013384."},{"key":"7_CR9","first-page":"354","volume-title":"LNCS 516","author":"M.C.J.D. Eekelen van","year":"1991","unstructured":"Eekelen, M.C.J.D. van, 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\u2013369."},{"key":"7_CR10","first-page":"333","volume-title":"Single-threaded polymorphic lambda calculus","author":"J.C. Guzm\u00e1n","year":"1990","unstructured":"Guzm\u00e1n, J.C. and P. Hudak (1990). Single-threaded polymorphic lambda calculus, Proceedings of the 5th Annual Symposium on Logic in Computer Science, Philadelphia, IEEE Computer Society Press, pp. 333\u2013343."},{"key":"7_CR11","unstructured":"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 haskell, Technical report, Department of Computer Science, Glasgow University."},{"key":"7_CR12","unstructured":"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 University Press."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"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\u201330.","DOI":"10.1145\/96709.96711"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Milner, R. (1984). A proposal for standard ML, Proceedings of the ACM Symposium on LISP and Functional Programming, Austin, pp. 184\u2013197.","DOI":"10.1145\/800055.802035"},{"key":"7_CR15","first-page":"255","volume-title":"Strictness analysis using abstract reduction","author":"E.G.J.M.H. N\u00f6cker","year":"1993","unstructured":"N\u00f6cker, 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\u2013265."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"N\u00f6cker, E.G.J.M.H. and J.E.W. Smetsers (1993). Partially strict non-recursive data types, Journal of Functional Programming.","DOI":"10.1017\/S0956796800000691"},{"key":"7_CR17","first-page":"202","volume-title":"Lecture Notes in Computer Science 505","author":"E.G.J.M.H. N\u00f6cker","year":"1991","unstructured":"N\u00f6cker, 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\u2013219."},{"key":"7_CR18","unstructured":"Plasmeijer, M.J. and M.C.J.D. van Eekelen (1993). Functional Programming and Parallel Graph Rewriting, Addison-Wesley."},{"key":"7_CR19","unstructured":"Smetsers, J.E.W. (1993). Graph Rewriting and Functional Languages, Dissertation, University of Nijmegen."},{"key":"7_CR20","first-page":"592","volume-title":"LNCS 523","author":"J.E.W. Smetsers","year":"1991","unstructured":"Smetsers, J.E.W., E.G.J.M.H. N\u00f6cker, J.H.G. van Groningen and M.J. Plasmeijer (1991). Generating efficient code for lazy functional languages, Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '91), Cambridge, MA, USA, Springer Verlag, LNCS 523, pp. 592\u2013617."},{"key":"7_CR21","first-page":"1","volume-title":"Lecture Notes in Computer Science 201","author":"D.A. Turner","year":"1985","unstructured":"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, France, Lecture Notes in Computer Science 201, Springer-Verlag, Berlin, pp. 1\u201316."},{"key":"7_CR22","first-page":"1","volume-title":"Once upon a type","author":"D.N. Turner","year":"1995","unstructured":"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\u201311."},{"key":"7_CR23","first-page":"385","volume-title":"Linear types can change the world!","author":"P. Wadler","year":"1990","unstructured":"Wadler, P. (1990). Linear types can change the world!, Proceedings of the Working Conference on Programming Concepts and Methods, Israel, North-Holland, Amsterdam, pp. 385\u2013407."},{"key":"7_CR24","unstructured":"Wadsworth, C.P. (1971). Semantics and Pragmatics of the Lambda Calculus, Dissertation, Oxford University."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63172-0_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:42:38Z","timestamp":1619574158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63172-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631729","9783540692010"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-63172-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}