LEADER 03864nam a22006135i 4500
001 813876
003 TR_AnAIT
005 20260130222847
007 cr nn 008mamaa
008 130526s2003 ne | s |||| 0|eng d
020 |a9789401712910|9978-94-017-1291-0
024 7 |a10.1007/978-94-017-1291-0|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/15116
245 10|aDomain Theory, Logic and Computation|h[electronic resource] :|bProceedings of the 2nd International Symposium on Domain Theory, Sichuan, China, October 2001 /|cedited by Guo-Qiang Zhang, J. Lawson, Ying Ming Liu, M.K. Luo.
250 |a1st ed. 2003.
264 1|aDordrecht :|bSpringer Netherlands :|bImprint: Springer,|c2003.
300 |aXII, 197 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 ;|v3
505 0 |a1 Playful, streamlike computation -- 2 Universal types and what they are good for -- 3 Relational representations of hyper-continuous lattices -- 4 Convergence classes and spaces of partial functions -- 5 On meet-continuous dcpos -- 6 External characterizations of continuous sL-domains -- 7 Projectives and injectives in the category of quantales -- 8 On minimal event and concrete data structures -- 9 A note on strongly finite sequent structures.
520 |aDomains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other areas of computer science, and for applications in mathematics. Included in this proceedings volume are selected papers of original research presented at the 2nd International Symposium on Domain Theory in Chengdu, China. With authors from France, Germany, Great Britain, Ireland, Mexico, and China, the papers cover the latest research in these sub-areas: domains and computation, topology and convergence, domains, lattices, and continuity, and representations of domains as event and logical structures. Researchers and students in theoretical computer science should find this a valuable source of reference. The survey papers at the beginning should be of particular interest to those who wish to gain an understanding of some general ideas and techniques in this area.
650 0|aLogic.
650 0|aAlgebra.
650 0|aGeometry.
650 0|aMathematical logic.
650 0|aCompilers (Computer programs).
650 14|aLogic.
650 24|aOrder, Lattices, Ordered Algebraic Structures.
650 24|aGeometry.
650 24|aMathematical Logic and Foundations.
650 24|aCompilers and Interpreters.
700 1 |aGuo-Qiang Zhang.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
700 1 |aLawson, J.|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 |aLuo, M.K.|eeditor.|4edt|4http://id.loc.gov/vocabulary/relators/edt
710 2 |aSpringerLink (Online service)
773 0 |tSpringer Nature eBook
776 08|iPrinted edition:|z9781402018329
776 08|iPrinted edition:|z9789048165230
776 08|iPrinted edition:|z9789401712927
830 0|aSemantics Structures in Computation ;|v3
856 40|uhttps://doi.org/10.1007/978-94-017-1291-0
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)