Compiling nonlinear recursion to parallel iteration:
Abstract: "We present a method for compiling nonlinear recursion (on binary trees) to parallel iteration (for-loops) in the framework of logic programming. The basis of the compilation method are formed by theorems that give direct expressions of all variable bindings resulting from recursion....
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Uppsala, Sweden
1992
|
| Series: | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report
70 |
| Subjects: | |
| Summary: | Abstract: "We present a method for compiling nonlinear recursion (on binary trees) to parallel iteration (for-loops) in the framework of logic programming. The basis of the compilation method are formed by theorems that give direct expressions of all variable bindings resulting from recursion. Further, we show that our method opens up for an efficient non-standard internal representation of binary trees." |
| Physical Description: | 16 Bl. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011000586 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961015s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)36009243 | ||
| 035 | |a (DE-599)BVBBV011000586 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Millroth, Håkan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Compiling nonlinear recursion to parallel iteration |c Håkan Millroth |
| 264 | 1 | |a Uppsala, Sweden |c 1992 | |
| 300 | |a 16 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |v 70 | |
| 520 | 3 | |a Abstract: "We present a method for compiling nonlinear recursion (on binary trees) to parallel iteration (for-loops) in the framework of logic programming. The basis of the compilation method are formed by theorems that give direct expressions of all variable bindings resulting from recursion. Further, we show that our method opens up for an efficient non-standard internal representation of binary trees." | |
| 650 | 4 | |a Compiling (Electronic computers) | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Recursive programming | |
| 830 | 0 | |a Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |v 70 |w (DE-604)BV011000452 |9 70 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007364596 | ||
Record in the Search Index
| _version_ | 1804125491440910336 |
|---|---|
| any_adam_object | |
| author | Millroth, Håkan |
| author_facet | Millroth, Håkan |
| author_role | aut |
| author_sort | Millroth, Håkan |
| author_variant | h m hm |
| building | Verbundindex |
| bvnumber | BV011000586 |
| ctrlnum | (OCoLC)36009243 (DE-599)BVBBV011000586 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01513nam a2200325 cb4500</leader><controlfield tag="001">BV011000586</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961015s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36009243</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011000586</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Millroth, Håkan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Compiling nonlinear recursion to parallel iteration</subfield><subfield code="c">Håkan Millroth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Uppsala, Sweden</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 Bl.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report</subfield><subfield code="v">70</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a method for compiling nonlinear recursion (on binary trees) to parallel iteration (for-loops) in the framework of logic programming. The basis of the compilation method are formed by theorems that give direct expressions of all variable bindings resulting from recursion. Further, we show that our method opens up for an efficient non-standard internal representation of binary trees."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compiling (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive programming</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report</subfield><subfield code="v">70</subfield><subfield code="w">(DE-604)BV011000452</subfield><subfield code="9">70</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007364596</subfield></datafield></record></collection> |
| id | DE-604.BV011000586 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:02:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007364596 |
| oclc_num | 36009243 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 Bl. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |
| series2 | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |
| spelling | Millroth, Håkan Verfasser aut Compiling nonlinear recursion to parallel iteration Håkan Millroth Uppsala, Sweden 1992 16 Bl. txt rdacontent n rdamedia nc rdacarrier Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report 70 Abstract: "We present a method for compiling nonlinear recursion (on binary trees) to parallel iteration (for-loops) in the framework of logic programming. The basis of the compilation method are formed by theorems that give direct expressions of all variable bindings resulting from recursion. Further, we show that our method opens up for an efficient non-standard internal representation of binary trees." Compiling (Electronic computers) Logic programming Parallel programming (Computer science) Recursive programming Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report 70 (DE-604)BV011000452 70 |
| spellingShingle | Millroth, Håkan Compiling nonlinear recursion to parallel iteration Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report Compiling (Electronic computers) Logic programming Parallel programming (Computer science) Recursive programming |
| title | Compiling nonlinear recursion to parallel iteration |
| title_auth | Compiling nonlinear recursion to parallel iteration |
| title_exact_search | Compiling nonlinear recursion to parallel iteration |
| title_full | Compiling nonlinear recursion to parallel iteration Håkan Millroth |
| title_fullStr | Compiling nonlinear recursion to parallel iteration Håkan Millroth |
| title_full_unstemmed | Compiling nonlinear recursion to parallel iteration Håkan Millroth |
| title_short | Compiling nonlinear recursion to parallel iteration |
| title_sort | compiling nonlinear recursion to parallel iteration |
| topic | Compiling (Electronic computers) Logic programming Parallel programming (Computer science) Recursive programming |
| topic_facet | Compiling (Electronic computers) Logic programming Parallel programming (Computer science) Recursive programming |
| volume_link | (DE-604)BV011000452 |
| work_keys_str_mv | AT millrothhakan compilingnonlinearrecursiontoparalleliteration |