Handbook of Theoretical Computer Science: Formal models and semantics, Volume 2
The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing.
What people are saying - Write a review
We haven't found any reviews in the usual places.
HANDBOOK OF THEORETICAL COMPUTER SCIENCE
53 other sections not shown
abstract data types algebraic speciﬁcations algorithm automata automaton axioms Berlin Biichi binary called Cartesian closed categories complete Computer Science congruence consider construction context-free grammar context-free languages critical pairs deﬁnable deﬁned deﬁnition denotational semantics derivation deterministic domain Dynamic Logic elements equations equivalent example exists expressions extended ﬁnal ﬁnite ﬁnite set ﬁrst ﬁrst-order ﬁxed point formal formula function symbols given Hence Hoare logic hypergraphs identiﬁers iﬂ implementation induction initial algebra integer interpretation isomorphism lambda calculus Lecture Notes Lemma Logic Programming logical relations mapping mathematical monadic second-order monoid morphism natural numbers normal form notation Notes in Computer notion operations ordering partial correctness polymorphic predicate problem Proc procedure programming languages proof properties Proposition prove recognizable recursive result rewriting systems rule satisﬁes second-order logic Section sequence set of ﬁnite signature speciﬁcation Springer subset substitution syntactic syntax terminal Theorem theory uniﬁcation veriﬁcation word