Deductive Computer Programming

Zohar Manna · 1988

Abstract : It is generally agreed that providing a precise formal semantics for a programming language is helpful in fully understanding the language. This is especially true in the case of logic programming like languages for which the underlying logic provides a well-defined but insufficient semantic basis. Indeed, in addition to the usual model theoretic semantics of the logic, proof, theoretic deduction plays a crucial role in understanding logic programs. Moreover, for specific implementations of logic programming, e.g. PROLOG, the notion of deduction strategy is also important. Computer program languages.

Read the paper · More papers on PaperTik