On graph rewriting, reduction, and evaluation in the presence of cycles

We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.’s mechanical program derivations from the world of terms to the world of cyclic graphs. We also outline how to inter-derive...

Full description

Saved in:
Bibliographic Details
Published in:Higher-Order and Symbolic Computation 2013-12, Vol.26 (1-4), p.63-84
Main Author: Zerny, Ian
Format: Article
Language:English
Subjects:
Computational Intelligence
Computational Mathematics and Numerical Analysis
Computer Science
Mathematical Logic and Formal Languages
Symbolic and Algebraic Manipulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3
cites cdi_FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3
container_end_page 84
container_issue 1-4
container_start_page 63
container_title Higher-Order and Symbolic Computation
container_volume 26
creator Zerny, Ian
description We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.’s mechanical program derivations from the world of terms to the world of cyclic graphs. We also outline how to inter-derive a third style of graph reduction: a graph evaluator.
doi_str_mv 10.1007/s10990-014-9103-9
format article
fullrecord <record><control><sourceid>crossref_sprin</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s10990_014_9103_9</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_s10990_014_9103_9</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3</originalsourceid><addsrcrecordid>eNp9kMFOwzAMhiMEEmPwANzyAAvYTZs0RzTBhjRpFzhHaZp2nUpaJS1ob0-rcubk35Y_y_oIeUR4QgD5HBGUAgaYMoXAmboiK8wkZ5Bl8nrKPM8ZFwpuyV2MZ4AEUyVWZHf0tA6mP9HgfkIzNL7eTLEc7dB0fkONL6n7Nu1o5p42ng4nR_vgovPW0a6i9mJbF-_JTWXa6B7-6pp8vr1-bPfscNy9b18OzCbAFVOl4VJKIVJbWkQogGOaFQlHngmoHGYJiiIF4yAvbJ6r3PJ0HlsJRQmWrwkud23oYgyu0n1ovky4aAQ9m9CLCT2Z0LMJrSYmWZg47fraBX3uxuCnN_-BfgG_DGAA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On graph rewriting, reduction, and evaluation in the presence of cycles</title><source>SpringerLink Journals</source><creator>Zerny, Ian</creator><creatorcontrib>Zerny, Ian</creatorcontrib><description>We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.’s mechanical program derivations from the world of terms to the world of cyclic graphs. We also outline how to inter-derive a third style of graph reduction: a graph evaluator.</description><identifier>ISSN: 1388-3690</identifier><identifier>EISSN: 1573-0557</identifier><identifier>DOI: 10.1007/s10990-014-9103-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Computational Intelligence ; Computational Mathematics and Numerical Analysis ; Computer Science ; Mathematical Logic and Formal Languages ; Symbolic and Algebraic Manipulation</subject><ispartof>Higher-Order and Symbolic Computation, 2013-12, Vol.26 (1-4), p.63-84</ispartof><rights>Springer Science+Business Media New York 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3</citedby><cites>FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10990-014-9103-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10990-014-9103-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,1644,27924,27925,41418,42487,51318</link.rule.ids></links><search><creatorcontrib>Zerny, Ian</creatorcontrib><title>On graph rewriting, reduction, and evaluation in the presence of cycles</title><title>Higher-Order and Symbolic Computation</title><addtitle>Higher-Order Symb Comput</addtitle><description>We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.’s mechanical program derivations from the world of terms to the world of cyclic graphs. We also outline how to inter-derive a third style of graph reduction: a graph evaluator.</description><subject>Computational Intelligence</subject><subject>Computational Mathematics and Numerical Analysis</subject><subject>Computer Science</subject><subject>Mathematical Logic and Formal Languages</subject><subject>Symbolic and Algebraic Manipulation</subject><issn>1388-3690</issn><issn>1573-0557</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kMFOwzAMhiMEEmPwANzyAAvYTZs0RzTBhjRpFzhHaZp2nUpaJS1ob0-rcubk35Y_y_oIeUR4QgD5HBGUAgaYMoXAmboiK8wkZ5Bl8nrKPM8ZFwpuyV2MZ4AEUyVWZHf0tA6mP9HgfkIzNL7eTLEc7dB0fkONL6n7Nu1o5p42ng4nR_vgovPW0a6i9mJbF-_JTWXa6B7-6pp8vr1-bPfscNy9b18OzCbAFVOl4VJKIVJbWkQogGOaFQlHngmoHGYJiiIF4yAvbJ6r3PJ0HlsJRQmWrwkud23oYgyu0n1ovky4aAQ9m9CLCT2Z0LMJrSYmWZg47fraBX3uxuCnN_-BfgG_DGAA</recordid><startdate>20131201</startdate><enddate>20131201</enddate><creator>Zerny, Ian</creator><general>Springer US</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20131201</creationdate><title>On graph rewriting, reduction, and evaluation in the presence of cycles</title><author>Zerny, Ian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computational Intelligence</topic><topic>Computational Mathematics and Numerical Analysis</topic><topic>Computer Science</topic><topic>Mathematical Logic and Formal Languages</topic><topic>Symbolic and Algebraic Manipulation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zerny, Ian</creatorcontrib><collection>CrossRef</collection><jtitle>Higher-Order and Symbolic Computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zerny, Ian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On graph rewriting, reduction, and evaluation in the presence of cycles</atitle><jtitle>Higher-Order and Symbolic Computation</jtitle><stitle>Higher-Order Symb Comput</stitle><date>2013-12-01</date><risdate>2013</risdate><volume>26</volume><issue>1-4</issue><spage>63</spage><epage>84</epage><pages>63-84</pages><issn>1388-3690</issn><eissn>1573-0557</eissn><abstract>We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.’s mechanical program derivations from the world of terms to the world of cyclic graphs. We also outline how to inter-derive a third style of graph reduction: a graph evaluator.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10990-014-9103-9</doi><tpages>22</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1388-3690
ispartof Higher-Order and Symbolic Computation, 2013-12, Vol.26 (1-4), p.63-84
issn 1388-3690
1573-0557
language eng
recordid cdi_crossref_primary_10_1007_s10990_014_9103_9
source SpringerLink Journals
subjects Computational Intelligence
Computational Mathematics and Numerical Analysis
Computer Science
Mathematical Logic and Formal Languages
Symbolic and Algebraic Manipulation
title On graph rewriting, reduction, and evaluation in the presence of cycles
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T00%3A13%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20graph%20rewriting,%20reduction,%20and%20evaluation%20in%20the%20presence%20of%20cycles&rft.jtitle=Higher-Order%20and%20Symbolic%20Computation&rft.au=Zerny,%20Ian&rft.date=2013-12-01&rft.volume=26&rft.issue=1-4&rft.spage=63&rft.epage=84&rft.pages=63-84&rft.issn=1388-3690&rft.eissn=1573-0557&rft_id=info:doi/10.1007/s10990-014-9103-9&rft_dat=%3Ccrossref_sprin%3E10_1007_s10990_014_9103_9%3C/crossref_sprin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2039-9da3777664cdc110b03145b2313560fe15216b40ae08bc8898c34fe15c70bd0c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true