scientific article; zbMATH DE number 3688693

MaRDI QIDQ3883473zbMATH OpenFDO

Authors J. A. Bergstra, John V. Tucker

Publication date 1980

zbMATH Keywords

computable data typescomputable intermediate assertionsequational logicequational specificationsHoare logicsinitial algebra semanticspartial correctness

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75) 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

(3)

• Some questions about expressiveness and relative completeness in Hoare's logic
• Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
• Finite logical specifications of effectively separable data models

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 Q3883473)