Graph rewriting semantics for functional programming languages Export

@incollection{citeulike:2829574, abstract = {The lambda calculus forms without any question *the* theoretical backbone of functional programming languages. For the design and implementation of the lazy functional language Concurrent Clean we have used a related computational model: Term Graph Rewriting Systems (TGRS's). This paper wraps up our main conclusions after 10 years of experience with graph rewriting semantics for functional programming languages. TGRS's are not a direct extension of the lambda calculus, so one sometimes has to re-establish known theoretical results. But TGRS's are that much closer to the world of functional programming that its use has been proven to be very worthwhile. In TGRS's functions have names, there are constants, pattern matching and one can choose to either share expressions or copy them.}, author = {van Eekelen, Marko and Smetsers, Sjaak and Plasmeijer, Rinus}, citeulike-article-id = {2829574}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-63172-0_35}, doi = {10.1007/3-540-63172-0_35}, journal = {Computer Science Logic}, keywords = {functional, graph-rewriting, semantics}, pages = {106--128}, posted-at = {2008-05-25 10:56:59}, priority = {0}, title = {Graph rewriting semantics for functional programming languages}, url = {http://dx.doi.org/10.1007/3-540-63172-0_35}, year = {1997} }

TY - CHAP ID - citeulike:2829574 L3 - citeulike-article-id:2829574 N2 - The lambda calculus forms without any question *the* theoretical backbone of functional programming languages. For the design and implementation of the lazy functional language Concurrent Clean we have used a related computational model: Term Graph Rewriting Systems (TGRS's). This paper wraps up our main conclusions after 10 years of experience with graph rewriting semantics for functional programming languages. TGRS's are not a direct extension of the lambda calculus, so one sometimes has to re-establish known theoretical results. But TGRS's are that much closer to the world of functional programming that its use has been proven to be very worthwhile. In TGRS's functions have names, there are constants, pattern matching and one can choose to either share expressions or copy them. JF - Computer Science Logic EP - 128 TI - Graph rewriting semantics for functional programming languages SP - 106 KW - functional KW - graph-rewriting KW - semantics AU - van Eekelen, Marko AU - Smetsers, Sjaak AU - Plasmeijer, Rinus PY - 1997/// UR - http://dx.doi.org/10.1007/3-540-63172-0_35 ER -