scientific article

zbMath0441.68025MaRDI QIDQ3883473

J. V. Tucker, Jan A. Bergstra

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

equational logicpartial correctnessHoare logicsequational specificationsinitial algebra semanticscomputable data typescomputable intermediate assertions

Mathematics Subject Classification ID

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

Related Items (2)

Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs ⋮ Some questions about expressiveness and relative completeness in Hoare's logic

This page was built for publication: