Static inference of modes and data dependencies in logic programs
Mode and data dependency analyses find many applications in the generation of efficient executable code for logic programs. For example, mode information can be used to generate specialized unification instructions where permissible, to detect determinacy and functionality of programs, generate inde...
Gespeichert in:
| Veröffentlicht in: | ACM transactions on programming languages and systems 1989-07, Vol.11 (3), p.418-450 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 450 |
|---|---|
| container_issue | 3 |
| container_start_page | 418 |
| container_title | ACM transactions on programming languages and systems |
| container_volume | 11 |
| creator | Debray, Saumya K. |
| description | Mode and data dependency analyses find many applications in the generation of efficient executable code for logic programs. For example, mode information can be used to generate specialized unification instructions where permissible, to detect determinacy and functionality of programs, generate index structures more intelligently, reduce the amount of runtime tests in systems that support goal suspension, and in the integration of logic and functional languages. Data dependency information can be used for various source-level optimizing transformations, to improve backtracking behavior and to parallelize logic programs. This paper describes and proves correct an algorithm for the static inference of modes and data dependencies in a program. The algorithm is shown to be quite efficient for programs commonly encountered in practice. |
| doi_str_mv | 10.1145/65979.65983 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29063384</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29063384</sourcerecordid><originalsourceid>FETCH-LOGICAL-a345t-6b032e9b6d152c78c7668c71df8d7422abd877aa2ca6368e90b57d9659adc2e23</originalsourceid><addsrcrecordid>eNpFkMtLAzEQxoMoWKsnLx5zEC-yNY9NNjkW8QUFD-o5zCazZWUfNdke_O-NbdHLDMz3m2-Yj5BLzhacl-pOK1vZRa5GHpEZV8oUpbLymMwY12XBrFCn5CylT8YYN8rMyPJtgqn1tB0ajDh4pGND-zFgojAEGmACGnCDQ8him6ftQLtxnTc2cVxH6NM5OWmgS3hx6HPy8fjwfv9crF6fXu6XqwJkqaZC10wKtLUOXAlfGV9pnQsPjQlVKQTUwVQVgPCgpTZoWa2qYPMvELxAIefkZu-bD39tMU2ub5PHroMBx21ywjItpSkzeLsHfRxTiti4TWx7iN-OM_cbk9vF5HYxZfr6YAvJQ9dEyH-mvxWtmWHcZuxqj4Hv_8Wdww-fL235</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29063384</pqid></control><display><type>article</type><title>Static inference of modes and data dependencies in logic programs</title><source>ACM Digital Library Complete</source><creator>Debray, Saumya K.</creator><creatorcontrib>Debray, Saumya K.</creatorcontrib><description>Mode and data dependency analyses find many applications in the generation of efficient executable code for logic programs. For example, mode information can be used to generate specialized unification instructions where permissible, to detect determinacy and functionality of programs, generate index structures more intelligently, reduce the amount of runtime tests in systems that support goal suspension, and in the integration of logic and functional languages. Data dependency information can be used for various source-level optimizing transformations, to improve backtracking behavior and to parallelize logic programs. This paper describes and proves correct an algorithm for the static inference of modes and data dependencies in a program. The algorithm is shown to be quite efficient for programs commonly encountered in practice.</description><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/65979.65983</identifier><identifier>CODEN: ATPSDT</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Applied sciences ; Compilers ; Computer science; control theory; systems ; Constraint and logic programming ; Exact sciences and technology ; Logic ; Program constructs ; Programming languages ; Semantics and reasoning ; Software ; Software and its engineering ; Software notations and tools ; Theory of computation ; Type structures</subject><ispartof>ACM transactions on programming languages and systems, 1989-07, Vol.11 (3), p.418-450</ispartof><rights>ACM</rights><rights>1990 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a345t-6b032e9b6d152c78c7668c71df8d7422abd877aa2ca6368e90b57d9659adc2e23</citedby><cites>FETCH-LOGICAL-a345t-6b032e9b6d152c78c7668c71df8d7422abd877aa2ca6368e90b57d9659adc2e23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/65979.65983$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,780,784,2282,27924,27925,40196,76228</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=6608019$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Debray, Saumya K.</creatorcontrib><title>Static inference of modes and data dependencies in logic programs</title><title>ACM transactions on programming languages and systems</title><addtitle>ACM TOPLAS</addtitle><description>Mode and data dependency analyses find many applications in the generation of efficient executable code for logic programs. For example, mode information can be used to generate specialized unification instructions where permissible, to detect determinacy and functionality of programs, generate index structures more intelligently, reduce the amount of runtime tests in systems that support goal suspension, and in the integration of logic and functional languages. Data dependency information can be used for various source-level optimizing transformations, to improve backtracking behavior and to parallelize logic programs. This paper describes and proves correct an algorithm for the static inference of modes and data dependencies in a program. The algorithm is shown to be quite efficient for programs commonly encountered in practice.</description><subject>Applied sciences</subject><subject>Compilers</subject><subject>Computer science; control theory; systems</subject><subject>Constraint and logic programming</subject><subject>Exact sciences and technology</subject><subject>Logic</subject><subject>Program constructs</subject><subject>Programming languages</subject><subject>Semantics and reasoning</subject><subject>Software</subject><subject>Software and its engineering</subject><subject>Software notations and tools</subject><subject>Theory of computation</subject><subject>Type structures</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNpFkMtLAzEQxoMoWKsnLx5zEC-yNY9NNjkW8QUFD-o5zCazZWUfNdke_O-NbdHLDMz3m2-Yj5BLzhacl-pOK1vZRa5GHpEZV8oUpbLymMwY12XBrFCn5CylT8YYN8rMyPJtgqn1tB0ajDh4pGND-zFgojAEGmACGnCDQ8him6ftQLtxnTc2cVxH6NM5OWmgS3hx6HPy8fjwfv9crF6fXu6XqwJkqaZC10wKtLUOXAlfGV9pnQsPjQlVKQTUwVQVgPCgpTZoWa2qYPMvELxAIefkZu-bD39tMU2ub5PHroMBx21ywjItpSkzeLsHfRxTiti4TWx7iN-OM_cbk9vF5HYxZfr6YAvJQ9dEyH-mvxWtmWHcZuxqj4Hv_8Wdww-fL235</recordid><startdate>19890701</startdate><enddate>19890701</enddate><creator>Debray, Saumya K.</creator><general>ACM</general><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>19890701</creationdate><title>Static inference of modes and data dependencies in logic programs</title><author>Debray, Saumya K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a345t-6b032e9b6d152c78c7668c71df8d7422abd877aa2ca6368e90b57d9659adc2e23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Applied sciences</topic><topic>Compilers</topic><topic>Computer science; control theory; systems</topic><topic>Constraint and logic programming</topic><topic>Exact sciences and technology</topic><topic>Logic</topic><topic>Program constructs</topic><topic>Programming languages</topic><topic>Semantics and reasoning</topic><topic>Software</topic><topic>Software and its engineering</topic><topic>Software notations and tools</topic><topic>Theory of computation</topic><topic>Type structures</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Debray, Saumya K.</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>Debray, Saumya K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Static inference of modes and data dependencies in logic programs</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><stitle>ACM TOPLAS</stitle><date>1989-07-01</date><risdate>1989</risdate><volume>11</volume><issue>3</issue><spage>418</spage><epage>450</epage><pages>418-450</pages><issn>0164-0925</issn><eissn>1558-4593</eissn><coden>ATPSDT</coden><abstract>Mode and data dependency analyses find many applications in the generation of efficient executable code for logic programs. For example, mode information can be used to generate specialized unification instructions where permissible, to detect determinacy and functionality of programs, generate index structures more intelligently, reduce the amount of runtime tests in systems that support goal suspension, and in the integration of logic and functional languages. Data dependency information can be used for various source-level optimizing transformations, to improve backtracking behavior and to parallelize logic programs. This paper describes and proves correct an algorithm for the static inference of modes and data dependencies in a program. The algorithm is shown to be quite efficient for programs commonly encountered in practice.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/65979.65983</doi><tpages>33</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0164-0925 |
| ispartof | ACM transactions on programming languages and systems, 1989-07, Vol.11 (3), p.418-450 |
| issn | 0164-0925 1558-4593 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29063384 |
| source | ACM Digital Library Complete |
| subjects | Applied sciences Compilers Computer science control theory systems Constraint and logic programming Exact sciences and technology Logic Program constructs Programming languages Semantics and reasoning Software Software and its engineering Software notations and tools Theory of computation Type structures |
| title | Static inference of modes and data dependencies in logic programs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T07%3A37%3A06IST&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=Static%20inference%20of%20modes%20and%20data%20dependencies%20in%20logic%20programs&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=Debray,%20Saumya%20K.&rft.date=1989-07-01&rft.volume=11&rft.issue=3&rft.spage=418&rft.epage=450&rft.pages=418-450&rft.issn=0164-0925&rft.eissn=1558-4593&rft.coden=ATPSDT&rft_id=info:doi/10.1145/65979.65983&rft_dat=%3Cproquest_cross%3E29063384%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=29063384&rft_id=info:pmid/&rfr_iscdi=true |