A compiler for rewrite programs in associative-commutative theories
We address the problem of term normalisation modulo associative-commutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for w...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 249 |
|---|---|
| container_issue | |
| container_start_page | 230 |
| container_title | |
| container_volume | |
| creator | Moreau, Pierre-Etienne Kirchner, Hélène |
| description | We address the problem of term normalisation modulo associative-commutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. We show how to refine this algorithm to work in an eager way. General patterns are handled through a program transformation process. Variable instantiation resulting from the matching phase and construction of the resulting term are also addressed. Our experimental results with the system ELAN provide strong evidence that compilation of many-to-one AC normalisation using the combination of these few techniques is crucial for improving the performance of algebraic programming languages. |
| doi_str_mv | 10.1007/BFb0056617 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_1569699</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1569699</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1327-7c6a39ef8d0f202c26783f0601cdfb71b9039d0eb03b4c98d7a8c8dfdcd54d123</originalsourceid><addsrcrecordid>eNpFkMtOwzAURM1LopRs-AIvWLAJXNuJH8sSUUCqxAbWkeNHMTR1ZAcQf09KkbibudIcjUaD0AWBawIgbm6XHUDNOREH6IzVFVRKcC4P0YxwQkrGKnWECiXkzuM1EMqP0QwY0FKJip2iIuc3mI7RWjIxQ80Cm9gPYeMS9jHh5L5SGB0eUlwn3WcctljnHE3QY_h05QT3H-Pvj8dXF1Nw-RydeL3JrvjTOXpZ3j03D-Xq6f6xWazKgTAqSmG4Zsp5acFToIbyqaYHDsRY3wnSKWDKguuAdZVR0gotjbTeGltXllA2R5f73EFnozc-6a0JuR1S6HX6bknNFVdqwq72WJ6c7dqltovxPbcE2t2G7f-G7Aeq7l8Q</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A compiler for rewrite programs in associative-commutative theories</title><source>Springer Books</source><creator>Moreau, Pierre-Etienne ; Kirchner, Hélène</creator><contributor>Meinke, Karl ; Palamidessi, Catuscia ; Glaser, Hugh</contributor><creatorcontrib>Moreau, Pierre-Etienne ; Kirchner, Hélène ; Meinke, Karl ; Palamidessi, Catuscia ; Glaser, Hugh</creatorcontrib><description>We address the problem of term normalisation modulo associative-commutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. We show how to refine this algorithm to work in an eager way. General patterns are handled through a program transformation process. Variable instantiation resulting from the matching phase and construction of the resulting term are also addressed. Our experimental results with the system ELAN provide strong evidence that compilation of many-to-one AC normalisation using the combination of these few techniques is crucial for improving the performance of algebraic programming languages.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540650126</identifier><identifier>ISBN: 3540650121</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540497668</identifier><identifier>EISBN: 9783540497660</identifier><identifier>DOI: 10.1007/BFb0056617</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>AC many-to-one matching ; AC theories ; Applied sciences ; compilation ; Computer science; control theory; systems ; Exact sciences and technology ; Information retrieval. Graph ; Language theory and syntactical analysis ; rewrite systems ; Software ; Software engineering ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2006, p.230-249</ispartof><rights>Springer-Verlag Berlin Heidelberg 1998</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0056617$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0056617$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1569699$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Meinke, Karl</contributor><contributor>Palamidessi, Catuscia</contributor><contributor>Glaser, Hugh</contributor><creatorcontrib>Moreau, Pierre-Etienne</creatorcontrib><creatorcontrib>Kirchner, Hélène</creatorcontrib><title>A compiler for rewrite programs in associative-commutative theories</title><title>Lecture notes in computer science</title><description>We address the problem of term normalisation modulo associative-commutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. We show how to refine this algorithm to work in an eager way. General patterns are handled through a program transformation process. Variable instantiation resulting from the matching phase and construction of the resulting term are also addressed. Our experimental results with the system ELAN provide strong evidence that compilation of many-to-one AC normalisation using the combination of these few techniques is crucial for improving the performance of algebraic programming languages.</description><subject>AC many-to-one matching</subject><subject>AC theories</subject><subject>Applied sciences</subject><subject>compilation</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information retrieval. Graph</subject><subject>Language theory and syntactical analysis</subject><subject>rewrite systems</subject><subject>Software</subject><subject>Software engineering</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540650126</isbn><isbn>3540650121</isbn><isbn>3540497668</isbn><isbn>9783540497660</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkMtOwzAURM1LopRs-AIvWLAJXNuJH8sSUUCqxAbWkeNHMTR1ZAcQf09KkbibudIcjUaD0AWBawIgbm6XHUDNOREH6IzVFVRKcC4P0YxwQkrGKnWECiXkzuM1EMqP0QwY0FKJip2iIuc3mI7RWjIxQ80Cm9gPYeMS9jHh5L5SGB0eUlwn3WcctljnHE3QY_h05QT3H-Pvj8dXF1Nw-RydeL3JrvjTOXpZ3j03D-Xq6f6xWazKgTAqSmG4Zsp5acFToIbyqaYHDsRY3wnSKWDKguuAdZVR0gotjbTeGltXllA2R5f73EFnozc-6a0JuR1S6HX6bknNFVdqwq72WJ6c7dqltovxPbcE2t2G7f-G7Aeq7l8Q</recordid><startdate>20060602</startdate><enddate>20060602</enddate><creator>Moreau, Pierre-Etienne</creator><creator>Kirchner, Hélène</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>20060602</creationdate><title>A compiler for rewrite programs in associative-commutative theories</title><author>Moreau, Pierre-Etienne ; Kirchner, Hélène</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1327-7c6a39ef8d0f202c26783f0601cdfb71b9039d0eb03b4c98d7a8c8dfdcd54d123</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>AC many-to-one matching</topic><topic>AC theories</topic><topic>Applied sciences</topic><topic>compilation</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information retrieval. Graph</topic><topic>Language theory and syntactical analysis</topic><topic>rewrite systems</topic><topic>Software</topic><topic>Software engineering</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Moreau, Pierre-Etienne</creatorcontrib><creatorcontrib>Kirchner, Hélène</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Moreau, Pierre-Etienne</au><au>Kirchner, Hélène</au><au>Meinke, Karl</au><au>Palamidessi, Catuscia</au><au>Glaser, Hugh</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A compiler for rewrite programs in associative-commutative theories</atitle><btitle>Lecture notes in computer science</btitle><date>2006-06-02</date><risdate>2006</risdate><spage>230</spage><epage>249</epage><pages>230-249</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540650126</isbn><isbn>3540650121</isbn><eisbn>3540497668</eisbn><eisbn>9783540497660</eisbn><abstract>We address the problem of term normalisation modulo associative-commutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. We show how to refine this algorithm to work in an eager way. General patterns are handled through a program transformation process. Variable instantiation resulting from the matching phase and construction of the resulting term are also addressed. Our experimental results with the system ELAN provide strong evidence that compilation of many-to-one AC normalisation using the combination of these few techniques is crucial for improving the performance of algebraic programming languages.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0056617</doi><tpages>20</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2006, p.230-249 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1569699 |
| source | Springer Books |
| subjects | AC many-to-one matching AC theories Applied sciences compilation Computer science control theory systems Exact sciences and technology Information retrieval. Graph Language theory and syntactical analysis rewrite systems Software Software engineering Theoretical computing |
| title | A compiler for rewrite programs in associative-commutative theories |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T03%3A04%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20compiler%20for%20rewrite%20programs%20in%20associative-commutative%20theories&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Moreau,%20Pierre-Etienne&rft.date=2006-06-02&rft.spage=230&rft.epage=249&rft.pages=230-249&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540650126&rft.isbn_list=3540650121&rft_id=info:doi/10.1007/BFb0056617&rft_dat=%3Cpascalfrancis_sprin%3E1569699%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540497668&rft.eisbn_list=9783540497660&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |