What people are saying - Write a review
We haven't found any reviews in the usual places.
de BARKER J I ZUCKER
J A BERGSTRA J I KLOP J V TUCKER
29 other sections not shown
Other editions - View all
abstract algebra algorithm arithmetic assertion assume atomic axiomatization axioms backup biconnected components binary relation bisimulation Burstall called colimits Communicating Sequential Processes compact complete Computer Science consider constraints construction contains corresponding data domain define deﬁned deﬁnition denotational semantics denote derivation domain Dynamic Logic edges elements equations equivalent example expressions ﬁnite ﬁrst order ﬁxed-point ﬂashes formal formula functor given Goguen graph Hoare identiﬁers induction inﬁnite initial institution interpretation interval interval logic lemma logic program mapping Mathematical morphism natural numbers node non-standard models normal form notion occur operations pair parameters partial correctness path postcondition predicate proc procedure program scheme programming language programming logic proof system properties propositional prove recursive program relation result rule satisﬁes satisfy semantics sentences sequence signature speciﬁcation structural induction structure subset syntactic temporal logic termination theorem theory transition tree true V(Kl valid variables