scientific article; zbMATH DE number 3729430

MaRDI QIDQ3917477zbMATH OpenFDO

Authors J. A. Bergstra, John V. Tucker

Publication date 1981

zbMATH Keywords

algebraic Hoare logiccomputable datatypeequational specificationinitial algebra specificationspartial correctness of while programs

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited in

(5)

• Algebraic specifications of computable and semicomputable data types
• Hoare's logic and Peano's arithmetic
• A complete finite axiomatisation of the equational theory of common meadows
• Two theorems about the completeness of Hoare's logic
• The axiomatic semantics of programs based on Hoare's logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917477)