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: ...
Read More
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.
Read Less
Add this copy of Logic of Domains (Progress in Theoretical Computer to cart. $49.58, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1991 by Birkhäuser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Logic of Domains (Progress in Theoretical Computer to cart. $60.32, like new condition, Sold by Book Forest rated 4.0 out of 5 stars, ships from San Rafael, CA, UNITED STATES, published 1991 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Page block firm and clean, binding tight, boards straight. No markings of any kind. Fine, like new condition. Extremely fine. Previous owners name on the inside of front endpaper. Well packaged and promptly shipped from California. US veteran operated.
Add this copy of Logic of Domains to cart. $82.00, like new condition, Sold by PASCALE'S BOOKS rated 4.0 out of 5 stars, ships from NORTH READING, MA, UNITED STATES, published 1991 by Birkhauser:.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Not Issued with a Dust Jacket. 8vo-over 7¾"-9¾" tall. The first printing, 259 pages. This book "is a thorough study of some important logical aspects of domains as used in the denotational semantics of programming languages. Against a background of a well-developed and sophisticated domain theory, the author builds logical frameworks from domains and uses them for the derivation of program logics. The reader will gain from this work a broad and deep understanding of the state of knowledge in this vital area of theoretical computer science." FINE HARDCOVER.
