First-Order Programming Theories by Tamas Gergely
This work presents a purely classical first-order logical approach to the field of study in theoretical computer science sometimes referred to as the theory of programs, or programming theory. This field essentially attempts to provide a precise mathematical basis for the common activities involved in reasoning about computer programs and programming languages, and it also attempts to find practical applications in the areas of program specification, verification and programming language design. Many different approaches with different mathematical frameworks have been proposed as a basis for programming theory. They differ in the mathe- matical machinery they use to define and investigate programs and program properties and they also differ in the concepts they deal with to understand the programming paradigm. Different approaches use different tools and viewpoints to characterize the data environment of programs. Most of the approaches are related to mathe- matical logic and they provide their own logic. These logics, however, are very eclectic since they use special entities to reflect a special world of programs, and also, they are usually incomparable with each other. This Babel's mess irritated us and we decided to peel off the eclectic com- ponents and try to answer all the questions by using classical first-order logic.-
Fundamentals of Algebraic Graph Transformation
-
Models and Algorithms of Time-Dependent Scheduling
-
Theoretical Aspects of Distributed Computing in Sensor Networks
-
Handbook of Weighted Automata
-
Coping with Selfishness in Congestion Games
-
Restricted-Orientation Convexity
-
Fault-Tolerant Search Algorithms
-
Patterns in Permutations and Words
-
Semantic Integration of Heterogeneous Software Specifications
-
Theoretical Aspects of Local Search
-
Computability
-
Syntax-Directed Semantics
-
The Logic of Partial Information
-
Computing in Horn Clause Theories
-
Nonsequential Processes
-
Data Structures and Algorithms 3
-
Relations and Graphs
-
Fundamentals of Algebraic Specification 1
-
Iteration Theories
-
Semirings, Automata, Languages
-
Data Structures and Algorithms 1
-
Petri Nets
-
Kolmogorov Complexity and Computational Complexity
-
Temporal Logic of Programs
-
Confluent String Rewriting
-
Fundamentals of Algebraic Specification 2
-
Parsing Theory
-
Finiteness and Regularity in Semigroups and Formal Languages
-
Coloured Petri Nets
-
Algorithms in Combinatorial Geometry
-
Logics of Specification Languages
-
Graph and Model Transformation
-
Unfoldings
-
Stochastic Coalgebraic Logic
-
Process Algebras for Petri Nets
| SKU | Unavailable |
| ISBN 13 | 9783642635038 |
| ISBN 10 | 3642635032 |
| Title | First-Order Programming Theories |
| Author | Tamas Gergely |
| Series | Monographs In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2012-11-13 |
| Number of pages | 353 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |