Axiomatic Definitions of Programming Languages: A Theoretical Assessment
Name
MIT-LCS-TM-163.pdf
Size
7.5 MB
Format
Adobe PDF
Checksum (MD5)
13ce9e9eb0846e7012d71020fa7cadf2
Author(s)
Meyer, Albert R.
Halpern, Joseph Y.
Date Issued
April 1980
Series/Report no.
MIT-LCS-TM-163
Abstract
A precise definition is given of how partial correctness or termination assertions serve to define the semantics of classees of program schemes. Assertions involving only formulas of first order predicate calculus are proved capable of defining program scheme semantics, and effective axiom systems for deriving such assertions are described. Such axiomatic definitions are possible despite the limited expressive power of predicate calculus.
Persistent DSpace Link
