Proof rules for the programming language Euclid
From MaRDI portal
Publication:1249430
DOI10.1007/BF00260921zbMath0385.68009OpenAlexW2051871492MaRDI QIDQ1249430
J. V. Guttag, J. G. Mitchell, J. J. Horning, B. W. Lampson, 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
Related Items (9)
Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles ⋮ Weakest preconditioned goto axiom ⋮ Axiomatic semantics for escape statements ⋮ Fifty years of Hoare's logic ⋮ On removing the machine from the language ⋮ Semantics of algorithmic languages ⋮ On the notion of expressiveness and the rule of adaptation ⋮ 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
