Topological models for higher order control flow:
Abstract: "Semantic models are presented for two simple imperative languages with higher order constructs. In the first language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of hig...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,40 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Semantic models are presented for two simple imperative languages with higher order constructs. In the first language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c!s and c?x, for c a channel. We develop operational and denotational models for both languages, and study their relationships. Both in the definitions and the comparisons of the semantic models, convenient use is made of some tools from (metric) topology The operational models are based on (SOS-style) transition systems; the denotational definitions use domains specified as solutions of domain equations in a category of 1-bounded complete ultrametric spaces. In establishing the connection between the two kinds of models, fruitful use is made of Rutten's processes as terms technique. Another new tool consists in the use of metric transition systems, with a metric defined on the configurations of the system. In addition to higher order programming notions, we use higher order definitional techniques, e.g., in defining the semantic mappings as fixed points of (contractive) higher order operators. By Banach's theorem, such fixed points are unique, yielding another important proof principle for our paper. |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034672 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31372938 | ||
| 035 | |a (DE-599)BVBBV009034672 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bakker, Jacobus W. de |d 1939-2012 |e Verfasser |0 (DE-588)1047965461 |4 aut | |
| 245 | 1 | 0 | |a Topological models for higher order control flow |c J. W. de Bakker, F. van Breugel |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 19 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 93,40 | |
| 520 | 3 | |a Abstract: "Semantic models are presented for two simple imperative languages with higher order constructs. In the first language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c!s and c?x, for c a channel. We develop operational and denotational models for both languages, and study their relationships. Both in the definitions and the comparisons of the semantic models, convenient use is made of some tools from (metric) topology | |
| 520 | 3 | |a The operational models are based on (SOS-style) transition systems; the denotational definitions use domains specified as solutions of domain equations in a category of 1-bounded complete ultrametric spaces. In establishing the connection between the two kinds of models, fruitful use is made of Rutten's processes as terms technique. Another new tool consists in the use of metric transition systems, with a metric defined on the configurations of the system. In addition to higher order programming notions, we use higher order definitional techniques, e.g., in defining the semantic mappings as fixed points of (contractive) higher order operators. By Banach's theorem, such fixed points are unique, yielding another important proof principle for our paper. | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Semantics | |
| 700 | 1 | |a Breugel, Franck van |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,40 |w (DE-604)BV008928356 |9 93,40 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005977210 | ||
Datensatz im Suchindex
| _version_ | 1804123388127477760 |
|---|---|
| any_adam_object | |
| author | Bakker, Jacobus W. de 1939-2012 Breugel, Franck van |
| author_GND | (DE-588)1047965461 |
| author_facet | Bakker, Jacobus W. de 1939-2012 Breugel, Franck van |
| author_role | aut aut |
| author_sort | Bakker, Jacobus W. de 1939-2012 |
| author_variant | j w d b jwd jwdb f v b fv fvb |
| building | Verbundindex |
| bvnumber | BV009034672 |
| ctrlnum | (OCoLC)31372938 (DE-599)BVBBV009034672 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02455nam a2200325 cb4500</leader><controlfield tag="001">BV009034672</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31372938</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034672</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="100" ind1="1" ind2=" "><subfield code="a">Bakker, Jacobus W. de</subfield><subfield code="d">1939-2012</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1047965461</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Topological models for higher order control flow</subfield><subfield code="c">J. W. de Bakker, F. van Breugel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">93,40</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Semantic models are presented for two simple imperative languages with higher order constructs. In the first language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c!s and c?x, for c a channel. We develop operational and denotational models for both languages, and study their relationships. Both in the definitions and the comparisons of the semantic models, convenient use is made of some tools from (metric) topology</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The operational models are based on (SOS-style) transition systems; the denotational definitions use domains specified as solutions of domain equations in a category of 1-bounded complete ultrametric spaces. In establishing the connection between the two kinds of models, fruitful use is made of Rutten's processes as terms technique. Another new tool consists in the use of metric transition systems, with a metric defined on the configurations of the system. In addition to higher order programming notions, we use higher order definitional techniques, e.g., in defining the semantic mappings as fixed points of (contractive) higher order operators. By Banach's theorem, such fixed points are unique, yielding another important proof principle for our paper.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Breugel, Franck van</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">93,40</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,40</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005977210</subfield></datafield></record></collection> |
| id | DE-604.BV009034672 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005977210 |
| oclc_num | 31372938 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Bakker, Jacobus W. de 1939-2012 Verfasser (DE-588)1047965461 aut Topological models for higher order control flow J. W. de Bakker, F. van Breugel Amsterdam 1993 19 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,40 Abstract: "Semantic models are presented for two simple imperative languages with higher order constructs. In the first language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c!s and c?x, for c a channel. We develop operational and denotational models for both languages, and study their relationships. Both in the definitions and the comparisons of the semantic models, convenient use is made of some tools from (metric) topology The operational models are based on (SOS-style) transition systems; the denotational definitions use domains specified as solutions of domain equations in a category of 1-bounded complete ultrametric spaces. In establishing the connection between the two kinds of models, fruitful use is made of Rutten's processes as terms technique. Another new tool consists in the use of metric transition systems, with a metric defined on the configurations of the system. In addition to higher order programming notions, we use higher order definitional techniques, e.g., in defining the semantic mappings as fixed points of (contractive) higher order operators. By Banach's theorem, such fixed points are unique, yielding another important proof principle for our paper. Computer programming Semantics Breugel, Franck van Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,40 (DE-604)BV008928356 93,40 |
| spellingShingle | Bakker, Jacobus W. de 1939-2012 Breugel, Franck van Topological models for higher order control flow Computer programming Semantics |
| title | Topological models for higher order control flow |
| title_auth | Topological models for higher order control flow |
| title_exact_search | Topological models for higher order control flow |
| title_full | Topological models for higher order control flow J. W. de Bakker, F. van Breugel |
| title_fullStr | Topological models for higher order control flow J. W. de Bakker, F. van Breugel |
| title_full_unstemmed | Topological models for higher order control flow J. W. de Bakker, F. van Breugel |
| title_short | Topological models for higher order control flow |
| title_sort | topological models for higher order control flow |
| topic | Computer programming Semantics |
| topic_facet | Computer programming Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT bakkerjacobuswde topologicalmodelsforhigherordercontrolflow AT breugelfranckvan topologicalmodelsforhigherordercontrolflow |