Implementing aggregates in parallel functional languages:
Abstract: "Many constructions which are difficult to write efficiently in pure functional languages have as underlying semantics an aggregate. An aggregate is a collection of individual elements whose order does not matter, it can thus be construted functionally using a commutative associative...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1989
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
176 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Many constructions which are difficult to write efficiently in pure functional languages have as underlying semantics an aggregate. An aggregate is a collection of individual elements whose order does not matter, it can thus be construted functionally using a commutative associative combining operator. Equivalent and more efficient implementations for aggregates exist which are operational. A new construction, the A-thread, an aggregate specified operationally which introduces provably local data indeterminacy, is defined. Operational specification of an aggregate, in which each element is specified by a separate functional call, does not necessarily destroy referential transparency in a functional language Aggregates defined using joins on partial orders allow early termination if an operational implementation is used: Arvind's 'I-structures' and Burton's 'improving values' are examples of this. |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010411100 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951006s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)20798156 | ||
| 035 | |a (DE-599)BVBBV010411100 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Clarke, Thomas J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Implementing aggregates in parallel functional languages |c by T. J. W. Clarke |
| 264 | 1 | |a Cambridge |c 1989 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 176 | |
| 520 | 3 | |a Abstract: "Many constructions which are difficult to write efficiently in pure functional languages have as underlying semantics an aggregate. An aggregate is a collection of individual elements whose order does not matter, it can thus be construted functionally using a commutative associative combining operator. Equivalent and more efficient implementations for aggregates exist which are operational. A new construction, the A-thread, an aggregate specified operationally which introduces provably local data indeterminacy, is defined. Operational specification of an aggregate, in which each element is specified by a separate functional call, does not necessarily destroy referential transparency in a functional language | |
| 520 | 3 | |a Aggregates defined using joins on partial orders allow early termination if an operational implementation is used: Arvind's 'I-structures' and Burton's 'improving values' are examples of this. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Information theory |2 sigle | |
| 650 | 4 | |a Functional programming languages | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 176 |w (DE-604)BV004055605 |9 176 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006933076 | ||
Datensatz im Suchindex
| _version_ | 1804124839243415552 |
|---|---|
| any_adam_object | |
| author | Clarke, Thomas J. |
| author_facet | Clarke, Thomas J. |
| author_role | aut |
| author_sort | Clarke, Thomas J. |
| author_variant | t j c tj tjc |
| building | Verbundindex |
| bvnumber | BV010411100 |
| ctrlnum | (OCoLC)20798156 (DE-599)BVBBV010411100 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01886nam a2200313 cb4500</leader><controlfield tag="001">BV010411100</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20798156</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411100</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="100" ind1="1" ind2=" "><subfield code="a">Clarke, Thomas J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Implementing aggregates in parallel functional languages</subfield><subfield code="c">by T. J. W. Clarke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 S.</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">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">176</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Many constructions which are difficult to write efficiently in pure functional languages have as underlying semantics an aggregate. An aggregate is a collection of individual elements whose order does not matter, it can thus be construted functionally using a commutative associative combining operator. Equivalent and more efficient implementations for aggregates exist which are operational. A new construction, the A-thread, an aggregate specified operationally which introduces provably local data indeterminacy, is defined. Operational specification of an aggregate, in which each element is specified by a separate functional call, does not necessarily destroy referential transparency in a functional language</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Aggregates defined using joins on partial orders allow early termination if an operational implementation is used: Arvind's 'I-structures' and Burton's 'improving values' are examples of this.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming languages</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">176</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">176</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933076</subfield></datafield></record></collection> |
| id | DE-604.BV010411100 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:02Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933076 |
| oclc_num | 20798156 |
| open_access_boolean | |
| physical | 13 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Clarke, Thomas J. Verfasser aut Implementing aggregates in parallel functional languages by T. J. W. Clarke Cambridge 1989 13 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 176 Abstract: "Many constructions which are difficult to write efficiently in pure functional languages have as underlying semantics an aggregate. An aggregate is a collection of individual elements whose order does not matter, it can thus be construted functionally using a commutative associative combining operator. Equivalent and more efficient implementations for aggregates exist which are operational. A new construction, the A-thread, an aggregate specified operationally which introduces provably local data indeterminacy, is defined. Operational specification of an aggregate, in which each element is specified by a separate functional call, does not necessarily destroy referential transparency in a functional language Aggregates defined using joins on partial orders allow early termination if an operational implementation is used: Arvind's 'I-structures' and Burton's 'improving values' are examples of this. Computer software sigle Information theory sigle Functional programming languages Computer Laboratory <Cambridge>: Technical report 176 (DE-604)BV004055605 176 |
| spellingShingle | Clarke, Thomas J. Implementing aggregates in parallel functional languages Computer Laboratory <Cambridge>: Technical report Computer software sigle Information theory sigle Functional programming languages |
| title | Implementing aggregates in parallel functional languages |
| title_auth | Implementing aggregates in parallel functional languages |
| title_exact_search | Implementing aggregates in parallel functional languages |
| title_full | Implementing aggregates in parallel functional languages by T. J. W. Clarke |
| title_fullStr | Implementing aggregates in parallel functional languages by T. J. W. Clarke |
| title_full_unstemmed | Implementing aggregates in parallel functional languages by T. J. W. Clarke |
| title_short | Implementing aggregates in parallel functional languages |
| title_sort | implementing aggregates in parallel functional languages |
| topic | Computer software sigle Information theory sigle Functional programming languages |
| topic_facet | Computer software Information theory Functional programming languages |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT clarkethomasj implementingaggregatesinparallelfunctionallanguages |