Proof rules for the programming language Euclid

DOI10.1007/BF00260921MaRDI QIDQ1249430zbMATH OpenOpenAlexFDO

Authors John Guttag, J. J. Horning, Butler Lampson, J. G. Mitchell, Ralph L. London, Gerald J. Popek

Publication date 1978

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00260921

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(10)

• Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles
• Axiomatic semantics for escape statements
• On removing the machine from the language
• On the notion of expressiveness and the rule of adaptation
• Fifty years of Hoare's logic
• Weakest preconditioned goto axiom
• Tony Hoare: his path to the ACM Turing Award
• Semantics of algorithmic languages
• The axiomatic semantics of programs based on Hoare's logic
• A complete axiomatic semantics of spawning

This page was built for publication: Proof rules for the programming language Euclid

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