Predicate Logic as Programming Language
 |
 |
abstract = {The interpretation of predicate logic as a programming language is based upon the interpretation of implications B if A1 and ... and An as procedure declarations, where B is the procedure name and A1, \ldots, An is the set of procedure calls Ai constituting the procedure body. An axiomatisation of a problem domain is a program for solving problems in that domain. Individual problems are posed as theorems to be proved. Proofs are computations generated by the theorem-prover which executes the program incorporated in the axioms. Our thesis is that predicate logic is a useful and practical, high-level, non-deterministic programming language with sound theoretical foundations.},
address = {Amsterdam, The Netherlands},
apice = {PlIfip74},
author = {Robert A. Kowalski},
booktitle = {Information Processing 74 – Proceedings of the 1974 IFIP Congress},
pages = {569--574},
publisher = {North-Holland Publishing Company},
title = {Predicate Logic as Programming Language},
url = {https://dblp.uni-trier.de/rec/html/conf/ifip/Kowalski74},
year = 1974
}