Logic of Domains (Progress in Theoretical Computer Science) - Image 1

£89.99

Birkhauser Logic of Domains (Progress in Theoretical Computer Science)

Name: Logic of Domains (Progress in Theoretical Computer Science)
Brand: Birkhauser
Price: 89.99 GBP
Availability: InStock

Architecture & Microprocessors

It has never been this cheap. We have no record of a lower price.

£90 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 71 days · 71 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 71 days • 1 price levels

Days at Price

Price Analysis

Most common price: £90 (71 days, 100.0%)

Price range: £90 - £90

Price levels: 1 different prices over 71 days

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.

Product Specifications

Brand: Birkhauser
Format: hardcover
ASIN: 081763570X
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 01 January 1991
Listed Since: 12 January 2007

Barcode

No barcode data available

Birkhauser Logic of Domains (Progress in Theoretical Computer Science)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Logic of Domains (Progress in Theoretical Computer Science)

Domain Theory, Logic and Computation: Proceedings of the 2nd International Symposium on Domain Theory, Sichuan, China, October 2001: 3 (Semantics Structures in Computation, 3)

The Formal Semantics of Programming Languages: An Introduction (Foundations of Computing)

Domains and Lambda-Calculi: 46 (Cambridge Tracts in Theoretical Computer Science, Series Number 46)

Algebraic Approaches to Program Semantics (Monographs in Computer Science)

Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion (Progress in Theoretical Computer Science)

Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446)

Solving Higher-Order Equations: From Logic to Programming (Progress in Theoretical Computer Science)

First-Order Programming Theories: 24 (Monographs in Theoretical Computer Science. An EATCS Series, 24)

Semantic Domains in Computational Linguistics

The Semantics and Proof Theory of the Logic of Bunched Implications: 26 (Applied Logic Series, 26)

LOGIC PROGRAMMING THEORY PRACTICES A: Theory, Practices and Challenges (Computer Science, Technology and Applications)

Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)

Logics for Computer Science: Classical and Non-Classical

Computational Semantics with Functional Programming

Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8

An Introduction to Default Logic (Symbolic Computation)

Computational Semantics with Functional Programming

Adapting Proofs-as-Programs: The Curry--Howard Protocol (Monographs in Computer Science)

Analysis and Synthesis of Logics: How to Cut and Paste Reasoning Systems: 35 (Applied Logic Series, 35)

Lectures on the Logic of Computer Programming (CBMS-NSF Regional Conference Series in Applied Mathematics): 31 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 31)

Handbook of Spatial Logics

Programming with Higher-Order Logic

New Developments in Formal Languages and Applications: 113 (Studies in Computational Intelligence, 113)