Author: V. Stoltenberg-Hansen
Publisher: Cambridge University Press
ISBN: 9780521383448
Category : Computers
Languages : en
Pages : 366
Get Book Here
Book Description
Introductory textbook/general reference in domain theory for professionals in computer science and logic.
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 56
Get Book Here
Book Description
Author: Guo-Qiang Zhang
Publisher: Springer Science & Business Media
ISBN: 9401712913
Category : Philosophy
Languages : en
Pages : 204
Get Book Here
Book Description
Domains 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.
Author: Roberto M. Amadio
Publisher: Cambridge University Press
ISBN: 0521622778
Category : Computers
Languages : en
Pages : 504
Get Book Here
Book Description
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Author: Jean Goubault-Larrecq
Publisher: Cambridge University Press
ISBN: 1107328772
Category : Mathematics
Languages : en
Pages : 499
Get Book Here
Book Description
This unique book on modern topology looks well beyond traditional treatises and explores spaces that may, but need not, be Hausdorff. This is essential for domain theory, the cornerstone of semantics of computer languages, where the Scott topology is almost never Hausdorff. For the first time in a single volume, this book covers basic material on metric and topological spaces, advanced material on complete partial orders, Stone duality, stable compactness, quasi-metric spaces and much more. An early chapter on metric spaces serves as an invitation to the topic (continuity, limits, compactness, completeness) and forms a complete introductory course by itself. Graduate students and researchers alike will enjoy exploring this treasure trove of results. Full proofs are given, as well as motivating ideas, clear explanations, illuminating examples, application exercises and some more challenging problems for more advanced readers.
Author: G. Zhang
Publisher: Springer Science & Business Media
ISBN: 1461204453
Category : Computers
Languages : en
Pages : 264
Get Book Here
Book Description
This monograph studies the logical aspects of domains as used in de notational semantics of programming languages. Frameworks of domain logics are introduced; these serve as foundations for systematic derivations of proof systems from denotational semantics of programming languages. Any proof system so derived is guaranteed to agree with denotational se mantics in the sense that the denotation of any program coincides with the set of assertions true of it. The study focuses on two categories for dena tational semantics: SFP domains, and the less standard, but important, category of stable domains. The intended readership of this monograph includes researchers and graduate students interested in the relation between semantics of program ming languages and formal means of reasoning about programs. A basic knowledge of denotational semantics, mathematical logic, general topology, and category theory is helpful for a full understanding of the material. Part I SFP Domains Chapter 1 Introduction This chapter provides a brief exposition to domain theory, denotational se mantics, program logics, and proof systems. It discusses the importance of ideas and results on logic and topology to the understanding of the relation between denotational semantics and program logics. It also describes the motivation for the work presented by this monograph, and how that work fits into a more general program. Finally, it gives a short summary of the results of each chapter. 1. 1 Domain Theory Programming languages are languages with which to perform computa tion.
Author: Darren Crowdy
Publisher: SIAM
ISBN: 1611976154
Category : Mathematics
Languages : en
Pages : 456
Get Book Here
Book Description
Whenever two or more objects or entities—be they bubbles, vortices, black holes, magnets, colloidal particles, microorganisms, swimming bacteria, Brownian random walkers, airfoils, turbine blades, electrified drops, magnetized particles, dislocations, cracks, or heterogeneities in an elastic solid—interact in some ambient medium, they make holes in that medium. Such holey regions with interacting entities are called multiply connected. This book describes a novel mathematical framework for solving problems in two-dimensional, multiply connected regions. The framework is built on a central theoretical concept: the prime function, whose significance for the applied sciences, especially for solving problems in multiply connected domains, has been missed until recent work by the author. This monograph is a one-of-a-kind treatise on the prime function associated with multiply connected domains and how to use it in applications. The book contains many results familiar in the simply connected, or single-entity, case that are generalized naturally to any number of entities, in many instances for the first time. Solving Problems in Multiply Connected Domains is aimed at applied and pure mathematicians, engineers, physicists, and other natural scientists; the framework it describes finds application in a diverse array of contexts. The book provides a rich source of project material for undergraduate and graduate courses in the applied sciences and could serve as a complement to standard texts on advanced calculus, potential theory, partial differential equations and complex analysis, and as a supplement to texts on applied mathematical methods in engineering and science.
Author: Peter Ebenfelt
Publisher: Springer Science & Business Media
ISBN: 3764373164
Category : Mathematics
Languages : en
Pages : 298
Get Book Here
Book Description
Quadrature domains were singled out about 30 years ago by D. Aharonov and H.S. Shapiro in connection with an extremal problem in function theory. Since then, a series of coincidental discoveries put this class of planar domains at the center of crossroads of several quite independent mathematical theories, e.g., potential theory, Riemann surfaces, inverse problems, holomorphic partial differential equations, fluid mechanics, operator theory. The volume is devoted to recent advances in the theory of quadrature domains, illustrating well the multi-facet aspects of their nature. The book contains a large collection of open problems pertaining to the general theme of quadrature domains.
Author: Mark Green
Publisher: Princeton University Press
ISBN: 0691154244
Category : Mathematics
Languages : en
Pages : 298
Get Book Here
Book Description
Mumford-Tate groups are the fundamental symmetry groups of Hodge theory, a subject which rests at the center of contemporary complex algebraic geometry. This book is the first comprehensive exploration of Mumford-Tate groups and domains. Containing basic theory and a wealth of new views and results, it will become an essential resource for graduate students and researchers. Although Mumford-Tate groups can be defined for general structures, their theory and use to date has mainly been in the classical case of abelian varieties. While the book does examine this area, it focuses on the nonclassical case. The general theory turns out to be very rich, such as in the unexpected connections of finite dimensional and infinite dimensional representation theory of real, semisimple Lie groups. The authors give the complete classification of Hodge representations, a topic that should become a standard in the finite-dimensional representation theory of noncompact, real, semisimple Lie groups. They also indicate that in the future, a connection seems ready to be made between Lie groups that admit discrete series representations and the study of automorphic cohomology on quotients of Mumford-Tate domains by arithmetic groups. Bringing together complex geometry, representation theory, and arithmetic, this book opens up a fresh perspective on an important subject.
Author: Thomas Streicher
Publisher: World Scientific Publishing Company
ISBN: 9813106867
Category : Computers
Languages : en
Pages : 132
Get Book Here
Book Description
This textbook provides a basis for a PhD course on domain-theoretic semantics of functional programming languages and their meta-mathematical properties. It introduces basic domain theory and the technique of logical relations as developed by Scott and Plotkin. The solution of recursive domain equations is explained in detail.A complete discussion of the famous full abstraction problem for PCF (a functional Kernel language due to Scott and Plotkin) is given including a construction of the fully abstract Milner model using Kripke logical relations.A final chapter introduces computability in Scott domains and shows that this model is fully abstract and universal for appropriate extensions of PCF by parallel language constructs.
