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

£88.37

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

Name: First-Order Programming Theories: 24 (Monographs in Theoretical Computer Science. An EATCS Series, 24)
Brand: Springer
Price: 88.37 GBP
Availability: InStock

Architecture & Microprocessors

This is the most expensive it has ever been. Walk away.

£88 today · previous high £88 · all-time low £78

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 65 days · 65 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 65 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £78 (46 days, 70.8%)

Price range: £78 - £88

Price levels: 2 different prices over 65 days

Description

This book proposes a purely classical first-order logical approach to the theory of programming. The authors, leading members of the famous "Hungarian school", use this approach to give a unified and systematic presentation of the theory. This approach provides formal methods and tools for reasoning about computer programs and programming languages by allowing the syntactic and semantic characterization of programs, the description of program properties, and ways to check whether a given program satisfies certain properties. The basic methods are logical extension, inductive definition and their combination, all of which admit an appropriate first-order representation of data and time. The framework proposed by the authors allows the investigation and development of different programming theories and logics from a unified point of view. Dynamic and temporal logics, for example, are investigated and compared with respect to their expressive and proof-theoretic powers. The book should appeal to both theoretical researchers and students. For researchers in computer science the book provides a coherent presentation of a new approach which permits the solution of various problems in programming theory in a unified manner by the use of first-order logical tools. The book may serve as a basis for graduate courses in programming theory and logic as it covers all important questions arising between the theory of computation and formal descriptive languages and presents an appropriate derivation system.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3540542779
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 05 December 1991
Listed Since: 10 December 2006

Barcode

No barcode data available

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Logics for Computer Science: Classical and Non-Classical

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

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

Algebraic Approaches to Program Semantics (Monographs in Computer Science)

Programming with Higher-Order Logic

Logic and Implication: An Introduction to the General Algebraic Study of Non-classical Logics: 57 (Trends in Logic, 57)

Parallel and Distributed Logic Programming: Towards the Design of a Framework for the Next Generation Database Machines: 24 (Studies in Computational Intelligence, 24)

A Theory of Objects (Monographs in Computer Science)

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

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

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

Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics: 14 (Trends in Logic, 14)

Goal-Directed Proof Theory: 21 (Applied Logic Series, 21)

An Introduction to Formal Languages and Machine Computation

Logic of Domains (Progress in Theoretical Computer Science)

Multiprocessor Execution of Logic Programs

Weighted Automata, Formal Power Series and Weighted Logic (BestMasters)

Representation Theorems in Computer Science: A Treatment in Logic Engineering

Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences, 24)

Structural Analysis of Non-Classical Logics: The Proceedings of the Second Taiwan Philosophical Logic Colloquium (Logic in Asia: Studia Logica Library)

Simple Type Theory: A Practical Logic for Expressing and Reasoning About Mathematical Ideas (Computer Science Foundations and Applied Logic)

Mathematical Methods in Linguistics: 30 (Studies in Linguistics and Philosophy, 30)

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

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