Logo

A Practical Theory of Programming

Large book cover: A Practical Theory of Programming

A Practical Theory of Programming
by

Publisher: Springer
ISBN/ASIN: 0387941061
ISBN-13: 9780387941066
Number of pages: 243

Description:
Understanding programming and programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. The author describes a programming theory which is much simpler and more comprehensive than the current theories to date. In the theoretical model, a specification is just a boolean expression and refinement is just an ordinary implication. The author develops a practical and broad method for writing precise specifications and designing programs whose executions probably satisfy the specifications.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Practical Foundations for Programming LanguagesPractical Foundations for Programming Languages
by
This is a book on the foundations of programming languages. The emphasis is on the concept of type, which organizes the computational universe in the same way that the concept of set may be seen as an organizing principle for mathematics.
(12126 views)
Book cover: Compositional SemanticsCompositional Semantics
by - UMass Amherst
Contents: Basic Categorial Syntax; Shortcomings of Standard Categorial Syntax; Expanded Categorial Syntax; Examples of Expanded Categorial Syntax; Categorial Logic; Basic Categorial Semantics; Lambda-Abstraction; Expanded Categorial Semantics; etc.
(9623 views)
Book cover: Formal LanguagesFormal Languages
by - Tampere University of Technology
In these notes the classical Chomskian formal language theory is fairly fully dealt with, omitting however much of automata constructs and computability issues. Surveys of Lindenmayer system theory and the mathematical theory of codes are given.
(4393 views)
Book cover: The Theory of Languages and ComputationThe Theory of Languages and Computation
by - University of Pennsylvania
From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.
(4086 views)