Designing a concurrent programming language:
Abstract: "This paper reviews the design and the evolution of a concurrent programming language Guarded Horn Clauses (GHC). GHC was born from a study of parallelism in logic programming, but turned out to be a simple and flexible concurrent programming language with a number of nice properties....
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Tokyo, Japan
1990
|
Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
581 |
Schlagworte: | |
Zusammenfassung: | Abstract: "This paper reviews the design and the evolution of a concurrent programming language Guarded Horn Clauses (GHC). GHC was born from a study of parallelism in logic programming, but turned out to be a simple and flexible concurrent programming language with a number of nice properties. We give both an abstract view of GHC computation based on the notion of transactions and a concrete view, namely an operational semantics, based on reductions. Also, we discuss in detail the properties of GHC such as its atomic operations, which have much to do with the design of GHC." |
Beschreibung: | 8 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010950027 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 960916s1990 |||| 00||| engod | ||
035 | |a (OCoLC)25180470 | ||
035 | |a (DE-599)BVBBV010950027 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Ueda, Kazunori |e Verfasser |4 aut | |
245 | 1 | 0 | |a Designing a concurrent programming language |c by K. Ueda |
264 | 1 | |a Tokyo, Japan |c 1990 | |
300 | |a 8 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 581 | |
520 | 3 | |a Abstract: "This paper reviews the design and the evolution of a concurrent programming language Guarded Horn Clauses (GHC). GHC was born from a study of parallelism in logic programming, but turned out to be a simple and flexible concurrent programming language with a number of nice properties. We give both an abstract view of GHC computation based on the notion of transactions and a concrete view, namely an operational semantics, based on reductions. Also, we discuss in detail the properties of GHC such as its atomic operations, which have much to do with the design of GHC." | |
650 | 4 | |a Concurrent programming | |
650 | 4 | |a GHC (Computer program language) | |
650 | 4 | |a Horn clauses | |
830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 581 |w (DE-604)BV010923438 |9 581 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007323876 |
Datensatz im Suchindex
_version_ | 1804125437193879552 |
---|---|
any_adam_object | |
author | Ueda, Kazunori |
author_facet | Ueda, Kazunori |
author_role | aut |
author_sort | Ueda, Kazunori |
author_variant | k u ku |
building | Verbundindex |
bvnumber | BV010950027 |
ctrlnum | (OCoLC)25180470 (DE-599)BVBBV010950027 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01571nam a2200313 cb4500</leader><controlfield tag="001">BV010950027</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960916s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25180470</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010950027</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">Ueda, Kazunori</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Designing a concurrent programming language</subfield><subfield code="c">by K. Ueda</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">581</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper reviews the design and the evolution of a concurrent programming language Guarded Horn Clauses (GHC). GHC was born from a study of parallelism in logic programming, but turned out to be a simple and flexible concurrent programming language with a number of nice properties. We give both an abstract view of GHC computation based on the notion of transactions and a concrete view, namely an operational semantics, based on reductions. Also, we discuss in detail the properties of GHC such as its atomic operations, which have much to do with the design of GHC."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrent programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GHC (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Horn clauses</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">581</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">581</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323876</subfield></datafield></record></collection> |
id | DE-604.BV010950027 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:01:32Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323876 |
oclc_num | 25180470 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 8 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
spelling | Ueda, Kazunori Verfasser aut Designing a concurrent programming language by K. Ueda Tokyo, Japan 1990 8 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 581 Abstract: "This paper reviews the design and the evolution of a concurrent programming language Guarded Horn Clauses (GHC). GHC was born from a study of parallelism in logic programming, but turned out to be a simple and flexible concurrent programming language with a number of nice properties. We give both an abstract view of GHC computation based on the notion of transactions and a concrete view, namely an operational semantics, based on reductions. Also, we discuss in detail the properties of GHC such as its atomic operations, which have much to do with the design of GHC." Concurrent programming GHC (Computer program language) Horn clauses Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 581 (DE-604)BV010923438 581 |
spellingShingle | Ueda, Kazunori Designing a concurrent programming language Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Concurrent programming GHC (Computer program language) Horn clauses |
title | Designing a concurrent programming language |
title_auth | Designing a concurrent programming language |
title_exact_search | Designing a concurrent programming language |
title_full | Designing a concurrent programming language by K. Ueda |
title_fullStr | Designing a concurrent programming language by K. Ueda |
title_full_unstemmed | Designing a concurrent programming language by K. Ueda |
title_short | Designing a concurrent programming language |
title_sort | designing a concurrent programming language |
topic | Concurrent programming GHC (Computer program language) Horn clauses |
topic_facet | Concurrent programming GHC (Computer program language) Horn clauses |
volume_link | (DE-604)BV010923438 |
work_keys_str_mv | AT uedakazunori designingaconcurrentprogramminglanguage |