Nonwellfounded sets and programming language semantics:
Abstract: "For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositonal semantics. The main difference with earlier work on this subject is the use of a nonstandard set theory that is based on Azcel's anti-foundati...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1990
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS
90,63 |
| Subjects: | |
| Online Access: | Volltext |
| Summary: | Abstract: "For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositonal semantics. The main difference with earlier work on this subject is the use of a nonstandard set theory that is based on Azcel's anti-foundation-axiom. Solving recursive domain equations in this theory leads to solutions that contain nonwellfounded elements. These are particularly useful for justifying recursive definitions, both of semantic operators and semantic models. The use of nonwellfounded sets further allows for the construction of compositional models for a larger class of transition systems than in the setting of complete metric spaces, which was used before." |
| Physical Description: | 17 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974439 | ||
| 003 | DE-604 | ||
| 005 | 20220228 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24806999 | ||
| 035 | |a (DE-599)BVBBV008974439 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Rutten, J. J. M. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Nonwellfounded sets and programming language semantics |c J. J. M. M. Rutten |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 17 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 90,63 | |
| 520 | 3 | |a Abstract: "For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositonal semantics. The main difference with earlier work on this subject is the use of a nonstandard set theory that is based on Azcel's anti-foundation-axiom. Solving recursive domain equations in this theory leads to solutions that contain nonwellfounded elements. These are particularly useful for justifying recursive definitions, both of semantic operators and semantic models. The use of nonwellfounded sets further allows for the construction of compositional models for a larger class of transition systems than in the setting of complete metric spaces, which was used before." | |
| 650 | 4 | |a Axiomatic set theory | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 830 | 0 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,63 |w (DE-604)BV008928356 |9 90,63 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5652 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926013 | ||
Record in the Search Index
| _version_ | 1804123312474816512 |
|---|---|
| any_adam_object | |
| author | Rutten, J. J. M. M. |
| author_facet | Rutten, J. J. M. M. |
| author_role | aut |
| author_sort | Rutten, J. J. M. M. |
| author_variant | j j m m r jjmm jjmmr |
| building | Verbundindex |
| bvnumber | BV008974439 |
| collection | ebook |
| ctrlnum | (OCoLC)24806999 (DE-599)BVBBV008974439 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01919nam a2200337 cb4500</leader><controlfield tag="001">BV008974439</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24806999</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974439</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><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rutten, J. J. M. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Nonwellfounded sets and programming language semantics</subfield><subfield code="c">J. J. M. M. Rutten</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">90,63</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositonal semantics. The main difference with earlier work on this subject is the use of a nonstandard set theory that is based on Azcel's anti-foundation-axiom. Solving recursive domain equations in this theory leads to solutions that contain nonwellfounded elements. These are particularly useful for justifying recursive definitions, both of semantic operators and semantic models. The use of nonwellfounded sets further allows for the construction of compositional models for a larger class of transition systems than in the setting of complete metric spaces, which was used before."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Axiomatic set theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,63</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,63</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5652</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926013</subfield></datafield></record></collection> |
| id | DE-604.BV008974439 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926013 |
| oclc_num | 24806999 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 17 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| spelling | Rutten, J. J. M. M. Verfasser aut Nonwellfounded sets and programming language semantics J. J. M. M. Rutten Amsterdam 1990 17 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,63 Abstract: "For a large class of transition systems that are defined by specifications in the SOS style, it is shown how these induce a compositonal semantics. The main difference with earlier work on this subject is the use of a nonstandard set theory that is based on Azcel's anti-foundation-axiom. Solving recursive domain equations in this theory leads to solutions that contain nonwellfounded elements. These are particularly useful for justifying recursive definitions, both of semantic operators and semantic models. The use of nonwellfounded sets further allows for the construction of compositional models for a larger class of transition systems than in the setting of complete metric spaces, which was used before." Axiomatic set theory Programming languages (Electronic computers) Semantics Erscheint auch als Online-Ausgabe Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,63 (DE-604)BV008928356 90,63 https://ir.cwi.nl/pub/5652 Verlag kostenfrei Volltext |
| spellingShingle | Rutten, J. J. M. M. Nonwellfounded sets and programming language semantics Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS Axiomatic set theory Programming languages (Electronic computers) Semantics |
| title | Nonwellfounded sets and programming language semantics |
| title_auth | Nonwellfounded sets and programming language semantics |
| title_exact_search | Nonwellfounded sets and programming language semantics |
| title_full | Nonwellfounded sets and programming language semantics J. J. M. M. Rutten |
| title_fullStr | Nonwellfounded sets and programming language semantics J. J. M. M. Rutten |
| title_full_unstemmed | Nonwellfounded sets and programming language semantics J. J. M. M. Rutten |
| title_short | Nonwellfounded sets and programming language semantics |
| title_sort | nonwellfounded sets and programming language semantics |
| topic | Axiomatic set theory Programming languages (Electronic computers) Semantics |
| topic_facet | Axiomatic set theory Programming languages (Electronic computers) Semantics |
| url | https://ir.cwi.nl/pub/5652 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ruttenjjmm nonwellfoundedsetsandprogramminglanguagesemantics |