Logics of domain:
Abstract: "This dissertation studies the logical aspects of domains as used in the denotational semantics of programming languages. Frameworks of domain logics are introduced which serve as basic tools for the systematic derivation of proof systems from the denotational semantics of programming...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Univ. of Cambridge, Computer Lab.
1989
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
185 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This dissertation studies the logical aspects of domains as used in the denotational semantics of programming languages. Frameworks of domain logics are introduced which serve as basic tools for the systematic derivation of proof systems from the denotational semantics of programming languages. The proof systems so derived are guaranteed to agree with the denotational semantics in the sense that the denotation of any program coincides with the set of assertions true of it. The study focuses on two frameworks for denotational semantics: the SFP domains, and the less standard, but important, category of dI-domains with stable functions An extended form of Scott's information systems are introduced to represent SFP objects. They provide better understanding of the structure of finite elements and open sets of domains. These systems generalise to a logic of SFP which uses inequational formulae to axiomatise entailment and non-entailment of open-set assertions. Soundness, completeness, and expressiveness results of the logic are obtained, and possible applications are investigated. A mu-calculus of Scott domains is introduced to extend the expressive power of the assertion language Special kinds of open sets called stable neighborhoods are introduced and shown to determine stable functions in a similar sense to that in which Scott-open sets determine continuous functions. Properties and constructions of stable neighborhoods on various categories of dI-domains are investigated. Logical frameworks for Girard's coherent spaces and Berry's dI-domains are given in which assertions are interpreted as stable neighborhoods. Various soundness, completeness, and expressiveness results are provided. |
| Beschreibung: | Literaturverz. S. 243 - 250. - Zugl.: Cambridge, Univ., Diss., 1989 |
| Beschreibung: | V, 250 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006618397 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 930315s1989 m||| 00||| eng d | ||
| 035 | |a (OCoLC)22409168 | ||
| 035 | |a (DE-599)BVBBV006618397 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 557d |2 stub | ||
| 084 | |a DAT 555d |2 stub | ||
| 100 | 1 | |a Zhang, Guo-Qiang |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Logics of domain |c Guo Qiang Zhang |
| 264 | 1 | |a Cambridge |b Univ. of Cambridge, Computer Lab. |c 1989 | |
| 300 | |a V, 250 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 185 | |
| 500 | |a Literaturverz. S. 243 - 250. - Zugl.: Cambridge, Univ., Diss., 1989 | ||
| 520 | 3 | |a Abstract: "This dissertation studies the logical aspects of domains as used in the denotational semantics of programming languages. Frameworks of domain logics are introduced which serve as basic tools for the systematic derivation of proof systems from the denotational semantics of programming languages. The proof systems so derived are guaranteed to agree with the denotational semantics in the sense that the denotation of any program coincides with the set of assertions true of it. The study focuses on two frameworks for denotational semantics: the SFP domains, and the less standard, but important, category of dI-domains with stable functions | |
| 520 | 3 | |a An extended form of Scott's information systems are introduced to represent SFP objects. They provide better understanding of the structure of finite elements and open sets of domains. These systems generalise to a logic of SFP which uses inequational formulae to axiomatise entailment and non-entailment of open-set assertions. Soundness, completeness, and expressiveness results of the logic are obtained, and possible applications are investigated. A mu-calculus of Scott domains is introduced to extend the expressive power of the assertion language | |
| 520 | 3 | |a Special kinds of open sets called stable neighborhoods are introduced and shown to determine stable functions in a similar sense to that in which Scott-open sets determine continuous functions. Properties and constructions of stable neighborhoods on various categories of dI-domains are investigated. Logical frameworks for Girard's coherent spaces and Berry's dI-domains are given in which assertions are interpreted as stable neighborhoods. Various soundness, completeness, and expressiveness results are provided. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Information theory |2 sigle | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 185 |w (DE-604)BV004055605 |9 185 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004229230 | ||
Datensatz im Suchindex
| _version_ | 1804120894674567168 |
|---|---|
| any_adam_object | |
| author | Zhang, Guo-Qiang |
| author_facet | Zhang, Guo-Qiang |
| author_role | aut |
| author_sort | Zhang, Guo-Qiang |
| author_variant | g q z gqz |
| building | Verbundindex |
| bvnumber | BV006618397 |
| classification_tum | DAT 557d DAT 555d |
| ctrlnum | (OCoLC)22409168 (DE-599)BVBBV006618397 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02934nam a2200373 cb4500</leader><controlfield tag="001">BV006618397</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930315s1989 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22409168</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006618397</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="084" ind1=" " ind2=" "><subfield code="a">DAT 557d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 555d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Guo-Qiang</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logics of domain</subfield><subfield code="c">Guo Qiang Zhang</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Univ. of Cambridge, Computer Lab.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">V, 250 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">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">185</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 243 - 250. - Zugl.: Cambridge, Univ., Diss., 1989</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This dissertation studies the logical aspects of domains as used in the denotational semantics of programming languages. Frameworks of domain logics are introduced which serve as basic tools for the systematic derivation of proof systems from the denotational semantics of programming languages. The proof systems so derived are guaranteed to agree with the denotational semantics in the sense that the denotation of any program coincides with the set of assertions true of it. The study focuses on two frameworks for denotational semantics: the SFP domains, and the less standard, but important, category of dI-domains with stable functions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">An extended form of Scott's information systems are introduced to represent SFP objects. They provide better understanding of the structure of finite elements and open sets of domains. These systems generalise to a logic of SFP which uses inequational formulae to axiomatise entailment and non-entailment of open-set assertions. Soundness, completeness, and expressiveness results of the logic are obtained, and possible applications are investigated. A mu-calculus of Scott domains is introduced to extend the expressive power of the assertion language</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Special kinds of open sets called stable neighborhoods are introduced and shown to determine stable functions in a similar sense to that in which Scott-open sets determine continuous functions. Properties and constructions of stable neighborhoods on various categories of dI-domains are investigated. Logical frameworks for Girard's coherent spaces and Berry's dI-domains are given in which assertions are interpreted as stable neighborhoods. Various soundness, completeness, and expressiveness results are provided.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">185</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">185</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004229230</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV006618397 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:49:20Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004229230 |
| oclc_num | 22409168 |
| open_access_boolean | |
| physical | V, 250 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Univ. of Cambridge, Computer Lab. |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Zhang, Guo-Qiang Verfasser aut Logics of domain Guo Qiang Zhang Cambridge Univ. of Cambridge, Computer Lab. 1989 V, 250 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 185 Literaturverz. S. 243 - 250. - Zugl.: Cambridge, Univ., Diss., 1989 Abstract: "This dissertation studies the logical aspects of domains as used in the denotational semantics of programming languages. Frameworks of domain logics are introduced which serve as basic tools for the systematic derivation of proof systems from the denotational semantics of programming languages. The proof systems so derived are guaranteed to agree with the denotational semantics in the sense that the denotation of any program coincides with the set of assertions true of it. The study focuses on two frameworks for denotational semantics: the SFP domains, and the less standard, but important, category of dI-domains with stable functions An extended form of Scott's information systems are introduced to represent SFP objects. They provide better understanding of the structure of finite elements and open sets of domains. These systems generalise to a logic of SFP which uses inequational formulae to axiomatise entailment and non-entailment of open-set assertions. Soundness, completeness, and expressiveness results of the logic are obtained, and possible applications are investigated. A mu-calculus of Scott domains is introduced to extend the expressive power of the assertion language Special kinds of open sets called stable neighborhoods are introduced and shown to determine stable functions in a similar sense to that in which Scott-open sets determine continuous functions. Properties and constructions of stable neighborhoods on various categories of dI-domains are investigated. Logical frameworks for Girard's coherent spaces and Berry's dI-domains are given in which assertions are interpreted as stable neighborhoods. Various soundness, completeness, and expressiveness results are provided. Computer software sigle Information theory sigle Programming languages (Electronic computers) Semantics (DE-588)4113937-9 Hochschulschrift gnd-content Computer Laboratory <Cambridge>: Technical report 185 (DE-604)BV004055605 185 |
| spellingShingle | Zhang, Guo-Qiang Logics of domain Computer Laboratory <Cambridge>: Technical report Computer software sigle Information theory sigle Programming languages (Electronic computers) Semantics |
| subject_GND | (DE-588)4113937-9 |
| title | Logics of domain |
| title_auth | Logics of domain |
| title_exact_search | Logics of domain |
| title_full | Logics of domain Guo Qiang Zhang |
| title_fullStr | Logics of domain Guo Qiang Zhang |
| title_full_unstemmed | Logics of domain Guo Qiang Zhang |
| title_short | Logics of domain |
| title_sort | logics of domain |
| topic | Computer software sigle Information theory sigle Programming languages (Electronic computers) Semantics |
| topic_facet | Computer software Information theory Programming languages (Electronic computers) Semantics Hochschulschrift |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT zhangguoqiang logicsofdomain |