Domains and Processes [electronic resource] : Proceedings of the 1st International Symposium on Domain Theory Shanghai, China, October 1999 / edited by Klaus Keimel, Guo-Qiang Zhang, Ying Ming Liu, Yixiang Chen.
Erişim Adresi
ISBN
9789401006545
Dil Kodu
İngilizce
Yer Numarası
DK/9159
Basım Bildirimi
1st ed. 2001.
Yayın Bilgisi
Dordrecht : Springer Netherlands : Imprint: Springer, 2001.
Fiziksel Niteleme
XIV, 273 p. online resource.
Dizi
Semantics Structures in Computation ; 1
İçindekiler Notu
1 Encounters Between Topology and Domain Theory -- 1 Introduction -- 2 Introductory Domain Theory -- 3 The Scott Topology -- 4 Locally Compact Spaces -- 5 Spectral Theory -- 6 Round Ideal Completions -- 7 Ordered Spaces -- 8 Compact Pospaces -- 9 Spaces of Maximal Points -- 10 The Domain of Closed Formal Balls -- 11 Fixed Point Theory -- 12 The Probabilistic Power Domain -- 13 Open Problems and Research Directions -- 14 Topological Appendix -- 2 The Lawson Topology on Quasicontinuous Domains -- 1 Introduction -- 2 Quasicontiuous domains -- 3 Strictly complete regularity of the Lawson topology -- 3 Uk-admitting dcpos need not be sober -- 1 Introduction -- 2 Uk-admitting for locally compact dcpo’s -- 3 Uk-admitting does not always imply sober -- 4 The Largest Topologically Cartesian Closed Categories of Domains as Topological Spaces -- 1 Introduction and Preliminaries -- 2 Relations between tcc and ccc categories -- 3 FS is the largest tcc full subcategory of CONT1 -- 4 F-FS is the largest tcc full subcategory of CONT -- 5 On the Equivalence of Some Approaches to Computability on the Real Line -- 1 Introduction -- 2 The TTE approach to real number computations -- 3 The domain-theoretic approach to real number computability -- 4 The language Real PCF -- 5 The equivalence results -- 6 Concluding remarks -- 7 Appendix -- 6 The continuous functionals of finite types over the reals -- 1 Introduction -- 2 The types -- 3 The hereditarily total objects -- 4 Density and co-density -- 5 Limit spaces -- 6 The traditional approach -- 7 Compact Semantics on Bc-domains -- 1 Introduction -- 2 Preliminaries and Characterizations for Semantics Continuity -- 3 The Compactness Theorem And Applications -- 4 Conclusion -- 8 Normal Subsets in Abstract Bases -- 1 Introduction -- 2 Prerequisites -- 3 Normal subsets and sub-domains -- 4 The dcpoclass of abstract bases and a fixed point theorem -- 9 Semantics of Logic Programs and Representation of Smyth Powerdomain -- 1 Introduction -- 2 Domains and information systems -- 3 Main representation theorem -- 4 Proofs -- 5 Examples -- 6 Semantics of disjunctive logic programs -- 7 Clausal logic over sequent structures -- 8 Conclusion -- 10 Domains of view: a foundation for specification and analysis -- 1 Introduction -- 2 Kripke modal transition systems -- 3 Fuzzy Kripke modal transition systems -- 4 Modal Markov chains -- 5 Modal relations -- 6 Related work -- 11 Semantic Theory and Proof System of Open Bisimulation for the ?-Calculus with Mismatching -- 1 Introduction -- 2 Operational Semantics of the ?-Calculus -- 3 Open Bisimulation and Its Symbolic Characterization -- 4 Proof System for Open Bisimulation -- 5 The Weak Case -- 6 Conclusions -- 12 Axiomatization without Prefix Combinator -- 1 Introduction -- 2 Preliminaries -- 3 Polyadic X-Calculus -- 4 A Process Calculus without Precedence -- 5 Ground Bisimilarity for Atomic X-Calculus -- 6 Axiomatization in the Absence of Prefix, Summation and Match Combinators -- 7 Final Remarks.
Özet, vb.
Domain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.
Konu
Logic.
Compilers (Computer programs).
Mathematical logic.
Logic.
Compilers and Interpreters.
Mathematical Logic and Foundations.
Compilers (Computer programs).
Mathematical logic.
Logic.
Compilers and Interpreters.
Mathematical Logic and Foundations.
Diğer Yazarlar
Kurum Adı
Eseri Alıntıla
Referansları kullanmadan önce gözden geçirmeniz ve varsa gerekli düzeltmeleri yapmanız önerilir.
Dijital Kaynak
MARC Görünümü
LEADER 06580nam a22006135i 4500
001 807866
003 TR_AnAIT
005 20260127004947
007 cr nn 008mamaa
008 121227s2001 ne | s |||| 0|eng d
020 |a9789401006545|9978-94-010-0654-5
024 7 |a10.1007/978-94-010-0654-5|2doi
041 |aeng
049 |aTürk Tarih Kurumu Kütüphanesi
050 4|aBC1-199
072 7|aHPL|2bicssc
072 7|aPHI011000|2bisacsh
072 7|aQDTL|2thema
082 04|a160|223
090 |aDK/9159
245 10|aDomains and Processes|h[electronic resource] :|bProceedings of the 1st International Symposium on Domain Theory Shanghai, China, October 1999 /|cedited by Klaus Keimel, Guo-Qiang Zhang, Ying Ming Liu, Yixiang Chen.
250 |a1st ed. 2001.
264 1|aDordrecht :|bSpringer Netherlands :|bImprint: Springer,|c2001.
300 |aXIV, 273 p.|bonline resource.
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
347 |atext file|bPDF|2rda
490 1 |aSemantics Structures in Computation ;|v1
505 0 |a1 Encounters Between Topology and Domain Theory -- 1 Introduction -- 2 Introductory Domain Theory -- 3 The Scott Topology -- 4 Locally Compact Spaces -- 5 Spectral Theory -- 6 Round Ideal Completions -- 7 Ordered Spaces -- 8 Compact Pospaces -- 9 Spaces of Maximal Points -- 10 The Domain of Closed Formal Balls -- 11 Fixed Point Theory -- 12 The Probabilistic Power Domain -- 13 Open Problems and Research Directions -- 14 Topological Appendix -- 2 The Lawson Topology on Quasicontinuous Domains -- 1 Introduction -- 2 Quasicontiuous domains -- 3 Strictly complete regularity of the Lawson topology -- 3 Uk-admitting dcpos need not be sober -- 1 Introduction -- 2 Uk-admitting for locally compact dcpo’s -- 3 Uk-admitting does not always imply sober -- 4 The Largest Topologically Cartesian Closed Categories of Domains as Topological Spaces -- 1 Introduction and Preliminaries -- 2 Relations between tcc and ccc categories -- 3 FS is the largest tcc full subcategory of CONT1 -- 4 F-FS is the largest tcc full subcategory of CONT -- 5 On the Equivalence of Some Approaches to Computability on the Real Line -- 1 Introduction -- 2 The TTE approach to real number computations -- 3 The domain-theoretic approach to real number computability -- 4 The language Real PCF -- 5 The equivalence results -- 6 Concluding remarks -- 7 Appendix -- 6 The continuous functionals of finite types over the reals -- 1 Introduction -- 2 The types -- 3 The hereditarily total objects -- 4 Density and co-density -- 5 Limit spaces -- 6 The traditional approach -- 7 Compact Semantics on Bc-domains -- 1 Introduction -- 2 Preliminaries and Characterizations for Semantics Continuity -- 3 The Compactness Theorem And Applications -- 4 Conclusion -- 8 Normal Subsets in Abstract Bases -- 1 Introduction -- 2 Prerequisites -- 3 Normal subsets and sub-domains -- 4 The dcpoclass of abstract bases and a fixed point theorem -- 9 Semantics of Logic Programs and Representation of Smyth Powerdomain -- 1 Introduction -- 2 Domains and information systems -- 3 Main representation theorem -- 4 Proofs -- 5 Examples -- 6 Semantics of disjunctive logic programs -- 7 Clausal logic over sequent structures -- 8 Conclusion -- 10 Domains of view: a foundation for specification and analysis -- 1 Introduction -- 2 Kripke modal transition systems -- 3 Fuzzy Kripke modal transition systems -- 4 Modal Markov chains -- 5 Modal relations -- 6 Related work -- 11 Semantic Theory and Proof System of Open Bisimulation for the ?-Calculus with Mismatching -- 1 Introduction -- 2 Operational Semantics of the ?-Calculus -- 3 Open Bisimulation and Its Symbolic Characterization -- 4 Proof System for Open Bisimulation -- 5 The Weak Case -- 6 Conclusions -- 12 Axiomatization without Prefix Combinator -- 1 Introduction -- 2 Preliminaries -- 3 Polyadic X-Calculus -- 4 A Process Calculus without Precedence -- 5 Ground Bisimilarity for Atomic X-Calculus -- 6 Axiomatization in the Absence of Prefix, Summation and Match Combinators -- 7 Final Remarks.
520 |aDomain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.
532 8 |aAccessibility summary: This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
532 8 |aInaccessible, or known limited accessibility
532 8 |aNo reading system accessibility options actively disabled
532 8 |aPublisher contact for further accessibility information: accessibilitysupport@springernature.com
650 0|aLogic.
650 0|aCompilers (Computer programs).
650 0|aMathematical logic.
650 14|aLogic.
650 24|aCompilers and Interpreters.
650 24|aMathematical Logic and Foundations.
700 1 |aKeimel, Klaus.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aGuo-Qiang Zhang.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aYing Ming Liu.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aYixiang Chen.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
710 2 |aSpringerLink (Online service)
773 0 |tSpringer Nature eBook
776 08|iPrinted edition:|z9780792371434
776 08|iPrinted edition:|z9789401006552
776 08|iPrinted edition:|z9789401038591
830 0|aSemantics Structures in Computation ;|v1
856 40|uhttps://doi.org/10.1007/978-94-010-0654-5
912 |aZDB-2-SHU
912 |aZDB-2-SXPR
912 |aZDB-2-BAE
950 |aHumanities, Social Sciences and Law (SpringerNature-11648)
950 |aPhilosophy and Religion (R0) (SpringerNature-43725)
001 807866
003 TR_AnAIT
005 20260127004947
007 cr nn 008mamaa
008 121227s2001 ne | s |||| 0|eng d
020 |a9789401006545|9978-94-010-0654-5
024 7 |a10.1007/978-94-010-0654-5|2doi
041 |aeng
049 |aTürk Tarih Kurumu Kütüphanesi
050 4|aBC1-199
072 7|aHPL|2bicssc
072 7|aPHI011000|2bisacsh
072 7|aQDTL|2thema
082 04|a160|223
090 |aDK/9159
245 10|aDomains and Processes|h[electronic resource] :|bProceedings of the 1st International Symposium on Domain Theory Shanghai, China, October 1999 /|cedited by Klaus Keimel, Guo-Qiang Zhang, Ying Ming Liu, Yixiang Chen.
250 |a1st ed. 2001.
264 1|aDordrecht :|bSpringer Netherlands :|bImprint: Springer,|c2001.
300 |aXIV, 273 p.|bonline resource.
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
347 |atext file|bPDF|2rda
490 1 |aSemantics Structures in Computation ;|v1
505 0 |a1 Encounters Between Topology and Domain Theory -- 1 Introduction -- 2 Introductory Domain Theory -- 3 The Scott Topology -- 4 Locally Compact Spaces -- 5 Spectral Theory -- 6 Round Ideal Completions -- 7 Ordered Spaces -- 8 Compact Pospaces -- 9 Spaces of Maximal Points -- 10 The Domain of Closed Formal Balls -- 11 Fixed Point Theory -- 12 The Probabilistic Power Domain -- 13 Open Problems and Research Directions -- 14 Topological Appendix -- 2 The Lawson Topology on Quasicontinuous Domains -- 1 Introduction -- 2 Quasicontiuous domains -- 3 Strictly complete regularity of the Lawson topology -- 3 Uk-admitting dcpos need not be sober -- 1 Introduction -- 2 Uk-admitting for locally compact dcpo’s -- 3 Uk-admitting does not always imply sober -- 4 The Largest Topologically Cartesian Closed Categories of Domains as Topological Spaces -- 1 Introduction and Preliminaries -- 2 Relations between tcc and ccc categories -- 3 FS is the largest tcc full subcategory of CONT1 -- 4 F-FS is the largest tcc full subcategory of CONT -- 5 On the Equivalence of Some Approaches to Computability on the Real Line -- 1 Introduction -- 2 The TTE approach to real number computations -- 3 The domain-theoretic approach to real number computability -- 4 The language Real PCF -- 5 The equivalence results -- 6 Concluding remarks -- 7 Appendix -- 6 The continuous functionals of finite types over the reals -- 1 Introduction -- 2 The types -- 3 The hereditarily total objects -- 4 Density and co-density -- 5 Limit spaces -- 6 The traditional approach -- 7 Compact Semantics on Bc-domains -- 1 Introduction -- 2 Preliminaries and Characterizations for Semantics Continuity -- 3 The Compactness Theorem And Applications -- 4 Conclusion -- 8 Normal Subsets in Abstract Bases -- 1 Introduction -- 2 Prerequisites -- 3 Normal subsets and sub-domains -- 4 The dcpoclass of abstract bases and a fixed point theorem -- 9 Semantics of Logic Programs and Representation of Smyth Powerdomain -- 1 Introduction -- 2 Domains and information systems -- 3 Main representation theorem -- 4 Proofs -- 5 Examples -- 6 Semantics of disjunctive logic programs -- 7 Clausal logic over sequent structures -- 8 Conclusion -- 10 Domains of view: a foundation for specification and analysis -- 1 Introduction -- 2 Kripke modal transition systems -- 3 Fuzzy Kripke modal transition systems -- 4 Modal Markov chains -- 5 Modal relations -- 6 Related work -- 11 Semantic Theory and Proof System of Open Bisimulation for the ?-Calculus with Mismatching -- 1 Introduction -- 2 Operational Semantics of the ?-Calculus -- 3 Open Bisimulation and Its Symbolic Characterization -- 4 Proof System for Open Bisimulation -- 5 The Weak Case -- 6 Conclusions -- 12 Axiomatization without Prefix Combinator -- 1 Introduction -- 2 Preliminaries -- 3 Polyadic X-Calculus -- 4 A Process Calculus without Precedence -- 5 Ground Bisimilarity for Atomic X-Calculus -- 6 Axiomatization in the Absence of Prefix, Summation and Match Combinators -- 7 Final Remarks.
520 |aDomain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.
532 8 |aAccessibility summary: This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
532 8 |aInaccessible, or known limited accessibility
532 8 |aNo reading system accessibility options actively disabled
532 8 |aPublisher contact for further accessibility information: accessibilitysupport@springernature.com
650 0|aLogic.
650 0|aCompilers (Computer programs).
650 0|aMathematical logic.
650 14|aLogic.
650 24|aCompilers and Interpreters.
650 24|aMathematical Logic and Foundations.
700 1 |aKeimel, Klaus.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aGuo-Qiang Zhang.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aYing Ming Liu.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aYixiang Chen.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
710 2 |aSpringerLink (Online service)
773 0 |tSpringer Nature eBook
776 08|iPrinted edition:|z9780792371434
776 08|iPrinted edition:|z9789401006552
776 08|iPrinted edition:|z9789401038591
830 0|aSemantics Structures in Computation ;|v1
856 40|uhttps://doi.org/10.1007/978-94-010-0654-5
912 |aZDB-2-SHU
912 |aZDB-2-SXPR
912 |aZDB-2-BAE
950 |aHumanities, Social Sciences and Law (SpringerNature-11648)
950 |aPhilosophy and Religion (R0) (SpringerNature-43725)
Materyaller
Depodan talep edilen materyal sadece kütüphane içerisinde kullanılmaktadır.
Materyal dışarıya ödünç verilmemektedir.
Materyal dışarıya ödünç verilmemektedir.
