What people are saying - Write a review
We haven't found any reviews in the usual places.
B Courcelle M Nivat
E W Dijkstra
8 other sections not shown
Other editions - View all
abstract abstract data types algebraic theory algorithm algorithmic logic alphabet applied atomic attribute grammars axioms behaviour binary Boolean bounded called complete component Computer Science concurrent condition consider consistent construct contains context-free context-free grammar corresponding data type database defined definition denote derivation domain elements equations equivalent example exists finite set formal formula function given graph Hence implies induction initial algebra input integer interpretation introduced iterated Kripke frames labelled Lemma mapping marking mathematical modal logic morphisms mprog node notation operations pair paper parsing Petri nets predicate problem Proc production programming languages proof properties Proposition prove pushout recursive reduced relation resp result rules S-invariant S-sorted satisfies semantics sequence stack strict deterministic structure subfile subset symbols syntactic terminal Theorem tion token transformation transformed grammar transition tree true tuples two-level grammar variables vector