Parallel exponentiation of concrete data structures:
Abstract: "Berry and Curien, building on Kahn and Plotkin's theory of Concrete Data Structures and sequential functions, have defined a sequential exponentiation of Concrete Data Structures. Their construction gives rise to an appealing model of sequential algorithms and a functional progr...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, Pa.
1989
|
| Schriftenreihe: | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS
89,206 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Berry and Curien, building on Kahn and Plotkin's theory of Concrete Data Structures and sequential functions, have defined a sequential exponentiation of Concrete Data Structures. Their construction gives rise to an appealing model of sequential algorithms and a functional programming language CDS0, exhibiting some interesting semantic properties, such as: loss of extensionality; a notion of program equivalence sensitive to computation strategy; a lazy, coroutine-like semantics; full abstraction; identification of syntax and semantics. We propose to develop a similar model of concurrent computation by formulating an appropriate notion of parallel algorithm and generalizing their construction to a parallel exponentiation, while retaining analogous semantic properties The introduction of parallelism into this setting raises several interesting issues, such as the existence, nature and properties of a satisfactory model of parallel computation employing parallel algorithms; ideally one would like to obtain a cartesian closed category with appropriate notions of parallel application, currying and composition. We hope that our ideas will yield insights into the proper mathematical treatment of parallel programming. We present here our notion of parallel algorithm and our parallel exponentiation of Concrete Data Structures. We motivate carefully the ideas behind our construction, and we explain how it can be viewed as a natural generalization of the Berry-Curien construction We introduce application and currying operations suitable for our parallel setting. In order to justify our ideas and to place our work into context, we show some properties of our construction, and give a variety of examples. Finally, we indicate some directions for further research on issues raised by our model. |
| Beschreibung: | 34 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008948789 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)21054900 | ||
| 035 | |a (DE-599)BVBBV008948789 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 082 | 0 | |a 510.7808 |b C28r 89-206 | |
| 100 | 1 | |a Brookes, Stephen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel exponentiation of concrete data structures |c Stephen Brookes ; Shai Geva |
| 264 | 1 | |a Pittsburgh, Pa. |c 1989 | |
| 300 | |a 34 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |v 89,206 | |
| 520 | 3 | |a Abstract: "Berry and Curien, building on Kahn and Plotkin's theory of Concrete Data Structures and sequential functions, have defined a sequential exponentiation of Concrete Data Structures. Their construction gives rise to an appealing model of sequential algorithms and a functional programming language CDS0, exhibiting some interesting semantic properties, such as: loss of extensionality; a notion of program equivalence sensitive to computation strategy; a lazy, coroutine-like semantics; full abstraction; identification of syntax and semantics. We propose to develop a similar model of concurrent computation by formulating an appropriate notion of parallel algorithm and generalizing their construction to a parallel exponentiation, while retaining analogous semantic properties | |
| 520 | 3 | |a The introduction of parallelism into this setting raises several interesting issues, such as the existence, nature and properties of a satisfactory model of parallel computation employing parallel algorithms; ideally one would like to obtain a cartesian closed category with appropriate notions of parallel application, currying and composition. We hope that our ideas will yield insights into the proper mathematical treatment of parallel programming. We present here our notion of parallel algorithm and our parallel exponentiation of Concrete Data Structures. We motivate carefully the ideas behind our construction, and we explain how it can be viewed as a natural generalization of the Berry-Curien construction | |
| 520 | 3 | |a We introduce application and currying operations suitable for our parallel setting. In order to justify our ideas and to place our work into context, we show some properties of our construction, and give a variety of examples. Finally, we indicate some directions for further research on issues raised by our model. | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 700 | 1 | |a Geva, Shai |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: CMU-CS |t Carnegie-Mellon University <Pittsburgh, Pa.> |v 89,206 |w (DE-604)BV006187264 |9 89,206 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005904517 | ||
Datensatz im Suchindex
| _version_ | 1804123281677090816 |
|---|---|
| any_adam_object | |
| author | Brookes, Stephen Geva, Shai |
| author_facet | Brookes, Stephen Geva, Shai |
| author_role | aut aut |
| author_sort | Brookes, Stephen |
| author_variant | s b sb s g sg |
| building | Verbundindex |
| bvnumber | BV008948789 |
| ctrlnum | (OCoLC)21054900 (DE-599)BVBBV008948789 |
| dewey-full | 510.7808 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.7808 |
| dewey-search | 510.7808 |
| dewey-sort | 3510.7808 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02964nam a2200349 cb4500</leader><controlfield tag="001">BV008948789</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21054900</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008948789</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-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 89-206</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brookes, Stephen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel exponentiation of concrete data structures</subfield><subfield code="c">Stephen Brookes ; Shai Geva</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">34 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">Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS</subfield><subfield code="v">89,206</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Berry and Curien, building on Kahn and Plotkin's theory of Concrete Data Structures and sequential functions, have defined a sequential exponentiation of Concrete Data Structures. Their construction gives rise to an appealing model of sequential algorithms and a functional programming language CDS0, exhibiting some interesting semantic properties, such as: loss of extensionality; a notion of program equivalence sensitive to computation strategy; a lazy, coroutine-like semantics; full abstraction; identification of syntax and semantics. We propose to develop a similar model of concurrent computation by formulating an appropriate notion of parallel algorithm and generalizing their construction to a parallel exponentiation, while retaining analogous semantic properties</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The introduction of parallelism into this setting raises several interesting issues, such as the existence, nature and properties of a satisfactory model of parallel computation employing parallel algorithms; ideally one would like to obtain a cartesian closed category with appropriate notions of parallel application, currying and composition. We hope that our ideas will yield insights into the proper mathematical treatment of parallel programming. We present here our notion of parallel algorithm and our parallel exponentiation of Concrete Data Structures. We motivate carefully the ideas behind our construction, and we explain how it can be viewed as a natural generalization of the Berry-Curien construction</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We introduce application and currying operations suitable for our parallel setting. In order to justify our ideas and to place our work into context, we show some properties of our construction, and give a variety of examples. Finally, we indicate some directions for further research on issues raised by our model.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Geva, Shai</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CMU-CS</subfield><subfield code="t">Carnegie-Mellon University <Pittsburgh, Pa.></subfield><subfield code="v">89,206</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">89,206</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005904517</subfield></datafield></record></collection> |
| id | DE-604.BV008948789 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:17Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005904517 |
| oclc_num | 21054900 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 34 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |
| spelling | Brookes, Stephen Verfasser aut Parallel exponentiation of concrete data structures Stephen Brookes ; Shai Geva Pittsburgh, Pa. 1989 34 S. txt rdacontent n rdamedia nc rdacarrier Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS 89,206 Abstract: "Berry and Curien, building on Kahn and Plotkin's theory of Concrete Data Structures and sequential functions, have defined a sequential exponentiation of Concrete Data Structures. Their construction gives rise to an appealing model of sequential algorithms and a functional programming language CDS0, exhibiting some interesting semantic properties, such as: loss of extensionality; a notion of program equivalence sensitive to computation strategy; a lazy, coroutine-like semantics; full abstraction; identification of syntax and semantics. We propose to develop a similar model of concurrent computation by formulating an appropriate notion of parallel algorithm and generalizing their construction to a parallel exponentiation, while retaining analogous semantic properties The introduction of parallelism into this setting raises several interesting issues, such as the existence, nature and properties of a satisfactory model of parallel computation employing parallel algorithms; ideally one would like to obtain a cartesian closed category with appropriate notions of parallel application, currying and composition. We hope that our ideas will yield insights into the proper mathematical treatment of parallel programming. We present here our notion of parallel algorithm and our parallel exponentiation of Concrete Data Structures. We motivate carefully the ideas behind our construction, and we explain how it can be viewed as a natural generalization of the Berry-Curien construction We introduce application and currying operations suitable for our parallel setting. In order to justify our ideas and to place our work into context, we show some properties of our construction, and give a variety of examples. Finally, we indicate some directions for further research on issues raised by our model. Data structures (Computer science) Parallel programming (Computer science) Geva, Shai Verfasser aut Computer Science Department: CMU-CS Carnegie-Mellon University <Pittsburgh, Pa.> 89,206 (DE-604)BV006187264 89,206 |
| spellingShingle | Brookes, Stephen Geva, Shai Parallel exponentiation of concrete data structures Data structures (Computer science) Parallel programming (Computer science) |
| title | Parallel exponentiation of concrete data structures |
| title_auth | Parallel exponentiation of concrete data structures |
| title_exact_search | Parallel exponentiation of concrete data structures |
| title_full | Parallel exponentiation of concrete data structures Stephen Brookes ; Shai Geva |
| title_fullStr | Parallel exponentiation of concrete data structures Stephen Brookes ; Shai Geva |
| title_full_unstemmed | Parallel exponentiation of concrete data structures Stephen Brookes ; Shai Geva |
| title_short | Parallel exponentiation of concrete data structures |
| title_sort | parallel exponentiation of concrete data structures |
| topic | Data structures (Computer science) Parallel programming (Computer science) |
| topic_facet | Data structures (Computer science) Parallel programming (Computer science) |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT brookesstephen parallelexponentiationofconcretedatastructures AT gevashai parallelexponentiationofconcretedatastructures |