Initial algebra and final coalgebra semantics for concurrency:
Abstract: "The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others [sic] dual, and some conditions are given under which they coincide. More precisely, it is shown...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1994
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,9 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others [sic] dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well." |
| Beschreibung: | 57 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010157060 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950427s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)31484082 | ||
| 035 | |a (DE-599)BVBBV010157060 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Rutten, Jan J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Initial algebra and final coalgebra semantics for concurrency |c J. J. M. M. Rutten ; D. Turi |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 300 | |a 57 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 94,9 | |
| 520 | 3 | |a Abstract: "The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others [sic] dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well." | |
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 700 | 1 | |a Turi, Daniele |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,9 |w (DE-604)BV008928356 |9 94,9 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006747091 | ||
Datensatz im Suchindex
| _version_ | 1804124554016063488 |
|---|---|
| any_adam_object | |
| author | Rutten, Jan J. Turi, Daniele |
| author_facet | Rutten, Jan J. Turi, Daniele |
| author_role | aut aut |
| author_sort | Rutten, Jan J. |
| author_variant | j j r jj jjr d t dt |
| building | Verbundindex |
| bvnumber | BV010157060 |
| ctrlnum | (OCoLC)31484082 (DE-599)BVBBV010157060 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01565nam a2200289 cb4500</leader><controlfield tag="001">BV010157060</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950427s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31484082</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010157060</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">Rutten, Jan J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Initial algebra and final coalgebra semantics for concurrency</subfield><subfield code="c">J. J. M. M. Rutten ; D. Turi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">57 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">94,9</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others [sic] dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Turi, Daniele</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">94,9</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006747091</subfield></datafield></record></collection> |
| id | DE-604.BV010157060 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006747091 |
| oclc_num | 31484082 |
| open_access_boolean | |
| physical | 57 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Rutten, Jan J. Verfasser aut Initial algebra and final coalgebra semantics for concurrency J. J. M. M. Rutten ; D. Turi Amsterdam 1994 57 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,9 Abstract: "The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others [sic] dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well." Programming languages (Electronic computers) Turi, Daniele Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,9 (DE-604)BV008928356 94,9 |
| spellingShingle | Rutten, Jan J. Turi, Daniele Initial algebra and final coalgebra semantics for concurrency Programming languages (Electronic computers) |
| title | Initial algebra and final coalgebra semantics for concurrency |
| title_auth | Initial algebra and final coalgebra semantics for concurrency |
| title_exact_search | Initial algebra and final coalgebra semantics for concurrency |
| title_full | Initial algebra and final coalgebra semantics for concurrency J. J. M. M. Rutten ; D. Turi |
| title_fullStr | Initial algebra and final coalgebra semantics for concurrency J. J. M. M. Rutten ; D. Turi |
| title_full_unstemmed | Initial algebra and final coalgebra semantics for concurrency J. J. M. M. Rutten ; D. Turi |
| title_short | Initial algebra and final coalgebra semantics for concurrency |
| title_sort | initial algebra and final coalgebra semantics for concurrency |
| topic | Programming languages (Electronic computers) |
| topic_facet | Programming languages (Electronic computers) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ruttenjanj initialalgebraandfinalcoalgebrasemanticsforconcurrency AT turidaniele initialalgebraandfinalcoalgebrasemanticsforconcurrency |