Coinductive constructive programming for concurrent systems:
Abstract: "This paper investigates problems that emerge when the paradigm of constructive programming (proof-as-programs) is applied to concurrent programming, in particular Kahn-MacQueen-Keller style of stream based concurrent programming with nondeterminacy. The main interest in this paper is...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Tokyo, Japan
1991
|
Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
624 |
Schlagworte: | |
Zusammenfassung: | Abstract: "This paper investigates problems that emerge when the paradigm of constructive programming (proof-as-programs) is applied to concurrent programming, in particular Kahn-MacQueen-Keller style of stream based concurrent programming with nondeterminacy. The main interest in this paper is how streams are treated formally and how recursive programs on streams should be described as proof procedures. We regard streams as Brouwer's choice sequence, and introduce a natural deduction style of coinduction rule based on the categorical treatment of streams by T. Hagino to define recursive programs on streams Also, several examples including Eratosthenes' sieve algorithm and a nondeterministic stream merger are presented. |
Beschreibung: | 25 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010953751 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 960917s1991 |||| 00||| engod | ||
035 | |a (OCoLC)24995717 | ||
035 | |a (DE-599)BVBBV010953751 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Takayama, Yukihide |e Verfasser |4 aut | |
245 | 1 | 0 | |a Coinductive constructive programming for concurrent systems |c by Y. Takayama |
264 | 1 | |a Tokyo, Japan |c 1991 | |
300 | |a 25 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 624 | |
520 | 3 | |a Abstract: "This paper investigates problems that emerge when the paradigm of constructive programming (proof-as-programs) is applied to concurrent programming, in particular Kahn-MacQueen-Keller style of stream based concurrent programming with nondeterminacy. The main interest in this paper is how streams are treated formally and how recursive programs on streams should be described as proof procedures. We regard streams as Brouwer's choice sequence, and introduce a natural deduction style of coinduction rule based on the categorical treatment of streams by T. Hagino to define recursive programs on streams | |
520 | 3 | |a Also, several examples including Eratosthenes' sieve algorithm and a nondeterministic stream merger are presented. | |
650 | 4 | |a Constructive mathematics | |
650 | 4 | |a Parallel programming (Computer science) | |
830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 624 |w (DE-604)BV010923438 |9 624 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007326209 |
Datensatz im Suchindex
_version_ | 1804125440611188736 |
---|---|
any_adam_object | |
author | Takayama, Yukihide |
author_facet | Takayama, Yukihide |
author_role | aut |
author_sort | Takayama, Yukihide |
author_variant | y t yt |
building | Verbundindex |
bvnumber | BV010953751 |
ctrlnum | (OCoLC)24995717 (DE-599)BVBBV010953751 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01740nam a2200313 cb4500</leader><controlfield tag="001">BV010953751</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24995717</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953751</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">Takayama, Yukihide</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Coinductive constructive programming for concurrent systems</subfield><subfield code="c">by Y. Takayama</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 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">624</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper investigates problems that emerge when the paradigm of constructive programming (proof-as-programs) is applied to concurrent programming, in particular Kahn-MacQueen-Keller style of stream based concurrent programming with nondeterminacy. The main interest in this paper is how streams are treated formally and how recursive programs on streams should be described as proof procedures. We regard streams as Brouwer's choice sequence, and introduce a natural deduction style of coinduction rule based on the categorical treatment of streams by T. Hagino to define recursive programs on streams</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Also, several examples including Eratosthenes' sieve algorithm and a nondeterministic stream merger are presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constructive mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</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">624</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">624</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326209</subfield></datafield></record></collection> |
id | DE-604.BV010953751 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:01:36Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326209 |
oclc_num | 24995717 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 25 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
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 | Takayama, Yukihide Verfasser aut Coinductive constructive programming for concurrent systems by Y. Takayama Tokyo, Japan 1991 25 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 624 Abstract: "This paper investigates problems that emerge when the paradigm of constructive programming (proof-as-programs) is applied to concurrent programming, in particular Kahn-MacQueen-Keller style of stream based concurrent programming with nondeterminacy. The main interest in this paper is how streams are treated formally and how recursive programs on streams should be described as proof procedures. We regard streams as Brouwer's choice sequence, and introduce a natural deduction style of coinduction rule based on the categorical treatment of streams by T. Hagino to define recursive programs on streams Also, several examples including Eratosthenes' sieve algorithm and a nondeterministic stream merger are presented. Constructive mathematics Parallel programming (Computer science) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 624 (DE-604)BV010923438 624 |
spellingShingle | Takayama, Yukihide Coinductive constructive programming for concurrent systems Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Constructive mathematics Parallel programming (Computer science) |
title | Coinductive constructive programming for concurrent systems |
title_auth | Coinductive constructive programming for concurrent systems |
title_exact_search | Coinductive constructive programming for concurrent systems |
title_full | Coinductive constructive programming for concurrent systems by Y. Takayama |
title_fullStr | Coinductive constructive programming for concurrent systems by Y. Takayama |
title_full_unstemmed | Coinductive constructive programming for concurrent systems by Y. Takayama |
title_short | Coinductive constructive programming for concurrent systems |
title_sort | coinductive constructive programming for concurrent systems |
topic | Constructive mathematics Parallel programming (Computer science) |
topic_facet | Constructive mathematics Parallel programming (Computer science) |
volume_link | (DE-604)BV010923438 |
work_keys_str_mv | AT takayamayukihide coinductiveconstructiveprogrammingforconcurrentsystems |