The promotion and accumulation strategies in transformational programming

The promotion and accumulation strategies in transformational programming

The promotion strategy in transformational programming is a general method for achieving efficiency by exploiting the recursive structure in the dominant term of an algorithmic expression. For it to be carried out successfully, the original problem often has to be generalized by the inclusion of an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on programming languages and systems 1984-10, Vol.6 (4), p.487-504
1. Verfasser: BIRD, R. S
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Software
Software engineering
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 504
container_issue 4
container_start_page 487
container_title ACM transactions on programming languages and systems
container_volume 6
creator BIRD, R. S
description The promotion strategy in transformational programming is a general method for achieving efficiency by exploiting the recursive structure in the dominant term of an algorithmic expression. For it to be carried out successfully, the original problem often has to be generalized by the inclusion of an extra parameter, a technique known as accumulation. These strategies are illustrated by deriving algorithms for two nontrivial problems: (1) determining whether a given digraph is acyclic, and (2) constructing the longest subsequence of a given sequence of vertices that forms a connected path in a given digraph. The derivations also serve to emphasize the usefulness of certain notational devices in applicative expressions, especially infix operators.
doi_str_mv 10.1145/1780.1781
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29072244</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>24347066</sourcerecordid><originalsourceid>FETCH-LOGICAL-c421t-6543f9aa13831d975c0f9717290c52d7453fb84c7e6c865b07ecde30f8b90cbf3</originalsourceid><addsrcrecordid>eNqFkD1PwzAQhi0EEuVj4B9kQEgMAZ8_YntEFR-VKrGUOXIcuxjFSbGTgX-P01asLD7f3XPv6V6EbgA_ADD-CELmn5BwghbAuSwZV_QULTBUrMSK8HN0kdIXxhgklwu02nzaYheHMIx-6Avdt4U2ZgpTp_eFNEY92q23qfB9kZM-uSGGfVN38-Q26hB8v71CZ053yV4f4yX6eHneLN_K9fvravm0Lg0jMJYVZ9QprYFKCq0S3GCnBAiisOGkFYxT10hmhK2MrHiDhTWtpdjJJhONo5fo7qCbd39PNo118MnYrtO9HaZUZyFBCGP_g4wygasqg_cH0MQhpWhdvYs-6PhTA65nV-vZ1fmBzN4eRXUyunPZEOPT34ACovIt9Bc67HaU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24347066</pqid></control><display><type>article</type><title>The promotion and accumulation strategies in transformational programming</title><source>Association for Computing Machinery</source><creator>BIRD, R. S</creator><creatorcontrib>BIRD, R. S</creatorcontrib><description>The promotion strategy in transformational programming is a general method for achieving efficiency by exploiting the recursive structure in the dominant term of an algorithmic expression. For it to be carried out successfully, the original problem often has to be generalized by the inclusion of an extra parameter, a technique known as accumulation. These strategies are illustrated by deriving algorithms for two nontrivial problems: (1) determining whether a given digraph is acyclic, and (2) constructing the longest subsequence of a given sequence of vertices that forms a connected path in a given digraph. The derivations also serve to emphasize the usefulness of certain notational devices in applicative expressions, especially infix operators.</description><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/1780.1781</identifier><identifier>CODEN: ATPSDT</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Software ; Software engineering</subject><ispartof>ACM transactions on programming languages and systems, 1984-10, Vol.6 (4), p.487-504</ispartof><rights>1985 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c421t-6543f9aa13831d975c0f9717290c52d7453fb84c7e6c865b07ecde30f8b90cbf3</citedby><cites>FETCH-LOGICAL-c421t-6543f9aa13831d975c0f9717290c52d7453fb84c7e6c865b07ecde30f8b90cbf3</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><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=9129172$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>BIRD, R. S</creatorcontrib><title>The promotion and accumulation strategies in transformational programming</title><title>ACM transactions on programming languages and systems</title><description>The promotion strategy in transformational programming is a general method for achieving efficiency by exploiting the recursive structure in the dominant term of an algorithmic expression. For it to be carried out successfully, the original problem often has to be generalized by the inclusion of an extra parameter, a technique known as accumulation. These strategies are illustrated by deriving algorithms for two nontrivial problems: (1) determining whether a given digraph is acyclic, and (2) constructing the longest subsequence of a given sequence of vertices that forms a connected path in a given digraph. The derivations also serve to emphasize the usefulness of certain notational devices in applicative expressions, especially infix operators.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Software</subject><subject>Software engineering</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1984</creationdate><recordtype>article</recordtype><recordid>eNqFkD1PwzAQhi0EEuVj4B9kQEgMAZ8_YntEFR-VKrGUOXIcuxjFSbGTgX-P01asLD7f3XPv6V6EbgA_ADD-CELmn5BwghbAuSwZV_QULTBUrMSK8HN0kdIXxhgklwu02nzaYheHMIx-6Avdt4U2ZgpTp_eFNEY92q23qfB9kZM-uSGGfVN38-Q26hB8v71CZ053yV4f4yX6eHneLN_K9fvravm0Lg0jMJYVZ9QprYFKCq0S3GCnBAiisOGkFYxT10hmhK2MrHiDhTWtpdjJJhONo5fo7qCbd39PNo118MnYrtO9HaZUZyFBCGP_g4wygasqg_cH0MQhpWhdvYs-6PhTA65nV-vZ1fmBzN4eRXUyunPZEOPT34ACovIt9Bc67HaU</recordid><startdate>19841001</startdate><enddate>19841001</enddate><creator>BIRD, R. S</creator><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19841001</creationdate><title>The promotion and accumulation strategies in transformational programming</title><author>BIRD, R. S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c421t-6543f9aa13831d975c0f9717290c52d7453fb84c7e6c865b07ecde30f8b90cbf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1984</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Software</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>BIRD, R. S</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on programming languages and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>BIRD, R. S</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The promotion and accumulation strategies in transformational programming</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><date>1984-10-01</date><risdate>1984</risdate><volume>6</volume><issue>4</issue><spage>487</spage><epage>504</epage><pages>487-504</pages><issn>0164-0925</issn><eissn>1558-4593</eissn><coden>ATPSDT</coden><abstract>The promotion strategy in transformational programming is a general method for achieving efficiency by exploiting the recursive structure in the dominant term of an algorithmic expression. For it to be carried out successfully, the original problem often has to be generalized by the inclusion of an extra parameter, a technique known as accumulation. These strategies are illustrated by deriving algorithms for two nontrivial problems: (1) determining whether a given digraph is acyclic, and (2) constructing the longest subsequence of a given sequence of vertices that forms a connected path in a given digraph. The derivations also serve to emphasize the usefulness of certain notational devices in applicative expressions, especially infix operators.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/1780.1781</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0164-0925
ispartof ACM transactions on programming languages and systems, 1984-10, Vol.6 (4), p.487-504
issn 0164-0925
1558-4593
language eng
recordid cdi_proquest_miscellaneous_29072244
source Association for Computing Machinery
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Software
Software engineering
title The promotion and accumulation strategies in transformational programming
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T11%3A09%3A51IST&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=The%20promotion%20and%20accumulation%20strategies%20in%20transformational%20programming&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=BIRD,%20R.%20S&rft.date=1984-10-01&rft.volume=6&rft.issue=4&rft.spage=487&rft.epage=504&rft.pages=487-504&rft.issn=0164-0925&rft.eissn=1558-4593&rft.coden=ATPSDT&rft_id=info:doi/10.1145/1780.1781&rft_dat=%3Cproquest_cross%3E24347066%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=24347066&rft_id=info:pmid/&rfr_iscdi=true