Deductive and Declarative Programming by Peter Padawitz
Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages.-
The Optimal Implementation of Functional Programming Languages
-
Mathematics for Computer Graphics
-
The Clausal Theory of Types
-
Basic Proof Theory
-
Process Algebra
-
Nonmonotonic Reasoning
-
Applications of Process Algebra
- Reasoning about Gossip
-
Belief Revision
-
Mathematical Theory of Domains
-
Process Algebra: Equational Theories of Communicating Processes
-
Initial Algebras and Terminal Coalgebras
-
Rippling: Meta-Level Guidance for Mathematical Reasoning
-
Finite-State Techniques
-
Higher Order Logic and Hardware Verification
-
Formal Methods in Artificial Intelligence
-
Hybrid Graph Theory and Network Analysis
-
Data Refinement
-
Lambda-calculus, Combinators and Functional Programming
-
A Unifying Framework for Structured Analysis and Design Models
-
Concurrency Verification
-
Design Theory and Computer Science
-
Nets, Terms and Formulas
-
Computational Learning Theory
-
Metamathematics, Machines and Goedel's Proof
-
Formal Specification and Design
-
The Logic of Typed Feature Structures
-
Free Choice Petri Nets
-
Two-Level Functional Languages
-
Basic Simple Type Theory
-
Term Rewriting Systems
-
The Uncertain Reasoner's Companion
-
Information Flow
-
Domains and Lambda-Calculi
-
Formal Semantics and Pragmatics for Natural Language Querying
..promotes specification and programming on the basis of Horn logic with equality....His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming, neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. Xiang Li, Mathematical Reviews
| SKU | Unavailable |
| ISBN 13 | 9780521032513 |
| ISBN 10 | 0521032512 |
| Title | Deductive and Declarative Programming |
| Author | Peter Padawitz |
| Series | Cambridge Tracts In Theoretical Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2006-11-23 |
| Number of pages | 288 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |