Higher-level supercompilation as a metasystem transition

Issues related to metasystem transitions in the context of supercompilation are discussed. Manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation are considered. Based on this law, some approaches to the construction of metasystems by comb...

Full description

Saved in:
Bibliographic Details
Published in:Programming and computer software 2012-09, Vol.38 (5), p.231-244
Main Authors: Klyuchnikov, I. G., Romanenko, S. A.
Format: Article
Language:English
Subjects:
Artificial Intelligence
Computer Science
Operating Systems
Software Engineering
Software Engineering/Programming and Operating Systems
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c268t-29a475d28e3559f57f24df8ce14bf8073d111271217d91a3be3c5eba6543eeb03
container_end_page 244
container_issue 5
container_start_page 231
container_title Programming and computer software
container_volume 38
creator Klyuchnikov, I. G.
Romanenko, S. A.
description Issues related to metasystem transitions in the context of supercompilation are discussed. Manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation are considered. Based on this law, some approaches to the construction of metasystems by combining supercompilers are proposed. In particular, the usefulness of multi-result supercompilation for proving the equivalence of expressions and for two-level supercompilation is shown.
doi_str_mv 10.1134/S0361768812050027
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918611860</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918611860</sourcerecordid><originalsourceid>FETCH-LOGICAL-c268t-29a475d28e3559f57f24df8ce14bf8073d111271217d91a3be3c5eba6543eeb03</originalsourceid><addsrcrecordid>eNp1kEtLxEAQhAdRMK7-AG8Bz9Hueecoi7rCggf1HCZJZ82SlzNZYf-9CRE8iIemDvVVNRRj1wi3iELevYLQaLS1yEEBcHPCItRgE8E1nrJotpPZP2cXIewBEEDKiNlNvfsgnzT0RU0cDgP5om-HunFj3XexC7GLWxpdOIaR2nj0rgv1bF2ys8o1ga5-dMXeHx_e1ptk-_L0vL7fJgXXdkx46qRRJbcklEorZSouy8oWhDKvLBhRIiI3yNGUKTqRkygU5U4rKYhyECt2s_QOvv88UBizfX_w3fQy4ylajdPNFC5U4fsQPFXZ4OvW-WOGkM0DZX8GmjJ8yYSJ7Xbkf5v_D30DA09mlQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918611860</pqid></control><display><type>article</type><title>Higher-level supercompilation as a metasystem transition</title><source>Springer Nature</source><creator>Klyuchnikov, I. G. ; Romanenko, S. A.</creator><creatorcontrib>Klyuchnikov, I. G. ; Romanenko, S. A.</creatorcontrib><description>Issues related to metasystem transitions in the context of supercompilation are discussed. Manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation are considered. Based on this law, some approaches to the construction of metasystems by combining supercompilers are proposed. In particular, the usefulness of multi-result supercompilation for proving the equivalence of expressions and for two-level supercompilation is shown.</description><identifier>ISSN: 0361-7688</identifier><identifier>EISSN: 1608-3261</identifier><identifier>DOI: 10.1134/S0361768812050027</identifier><language>eng</language><publisher>Dordrecht: SP MAIK Nauka/Interperiodica</publisher><subject>Artificial Intelligence ; Computer Science ; Operating Systems ; Software Engineering ; Software Engineering/Programming and Operating Systems</subject><ispartof>Programming and computer software, 2012-09, Vol.38 (5), p.231-244</ispartof><rights>Pleiades Publishing, Ltd. 2012</rights><rights>Pleiades Publishing, Ltd. 2012.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c268t-29a475d28e3559f57f24df8ce14bf8073d111271217d91a3be3c5eba6543eeb03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Klyuchnikov, I. G.</creatorcontrib><creatorcontrib>Romanenko, S. A.</creatorcontrib><title>Higher-level supercompilation as a metasystem transition</title><title>Programming and computer software</title><addtitle>Program Comput Soft</addtitle><description>Issues related to metasystem transitions in the context of supercompilation are discussed. Manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation are considered. Based on this law, some approaches to the construction of metasystems by combining supercompilers are proposed. In particular, the usefulness of multi-result supercompilation for proving the equivalence of expressions and for two-level supercompilation is shown.</description><subject>Artificial Intelligence</subject><subject>Computer Science</subject><subject>Operating Systems</subject><subject>Software Engineering</subject><subject>Software Engineering/Programming and Operating Systems</subject><issn>0361-7688</issn><issn>1608-3261</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp1kEtLxEAQhAdRMK7-AG8Bz9Hueecoi7rCggf1HCZJZ82SlzNZYf-9CRE8iIemDvVVNRRj1wi3iELevYLQaLS1yEEBcHPCItRgE8E1nrJotpPZP2cXIewBEEDKiNlNvfsgnzT0RU0cDgP5om-HunFj3XexC7GLWxpdOIaR2nj0rgv1bF2ys8o1ga5-dMXeHx_e1ptk-_L0vL7fJgXXdkx46qRRJbcklEorZSouy8oWhDKvLBhRIiI3yNGUKTqRkygU5U4rKYhyECt2s_QOvv88UBizfX_w3fQy4ylajdPNFC5U4fsQPFXZ4OvW-WOGkM0DZX8GmjJ8yYSJ7Xbkf5v_D30DA09mlQ</recordid><startdate>20120901</startdate><enddate>20120901</enddate><creator>Klyuchnikov, I. G.</creator><creator>Romanenko, S. A.</creator><general>SP MAIK Nauka/Interperiodica</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20120901</creationdate><title>Higher-level supercompilation as a metasystem transition</title><author>Klyuchnikov, I. G. ; Romanenko, S. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c268t-29a475d28e3559f57f24df8ce14bf8073d111271217d91a3be3c5eba6543eeb03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Artificial Intelligence</topic><topic>Computer Science</topic><topic>Operating Systems</topic><topic>Software Engineering</topic><topic>Software Engineering/Programming and Operating Systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Klyuchnikov, I. G.</creatorcontrib><creatorcontrib>Romanenko, S. A.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Programming and computer software</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Klyuchnikov, I. G.</au><au>Romanenko, S. A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Higher-level supercompilation as a metasystem transition</atitle><jtitle>Programming and computer software</jtitle><stitle>Program Comput Soft</stitle><date>2012-09-01</date><risdate>2012</risdate><volume>38</volume><issue>5</issue><spage>231</spage><epage>244</epage><pages>231-244</pages><issn>0361-7688</issn><eissn>1608-3261</eissn><abstract>Issues related to metasystem transitions in the context of supercompilation are discussed. Manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation are considered. Based on this law, some approaches to the construction of metasystems by combining supercompilers are proposed. In particular, the usefulness of multi-result supercompilation for proving the equivalence of expressions and for two-level supercompilation is shown.</abstract><cop>Dordrecht</cop><pub>SP MAIK Nauka/Interperiodica</pub><doi>10.1134/S0361768812050027</doi><tpages>14</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0361-7688
ispartof Programming and computer software, 2012-09, Vol.38 (5), p.231-244
issn 0361-7688
1608-3261
language eng
recordid cdi_proquest_journals_2918611860
source Springer Nature
subjects Artificial Intelligence
Computer Science
Operating Systems
Software Engineering
Software Engineering/Programming and Operating Systems
title Higher-level supercompilation as a metasystem transition
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T20%3A08%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Higher-level%20supercompilation%20as%20a%20metasystem%20transition&rft.jtitle=Programming%20and%20computer%20software&rft.au=Klyuchnikov,%20I.%20G.&rft.date=2012-09-01&rft.volume=38&rft.issue=5&rft.spage=231&rft.epage=244&rft.pages=231-244&rft.issn=0361-7688&rft.eissn=1608-3261&rft_id=info:doi/10.1134/S0361768812050027&rft_dat=%3Cproquest_cross%3E2918611860%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c268t-29a475d28e3559f57f24df8ce14bf8073d111271217d91a3be3c5eba6543eeb03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2918611860&rft_id=info:pmid/&rfr_iscdi=true