Accession Number : AD0708071

Title :   PROPERTIES OF PROGRAMS AND PARTIAL FUNCTION LOGIC,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Manna,Zohar ; McCarthy,John

Report Date : OCT 1969

Pagination or Media Count : 24

Abstract : Recursive definitions are considered which consist of Algol-like conditional expressions. By specifying a computation rule for evaluating such recursive definition, it determines a partial function. However, for different computation rules, the same recursive definition may determine different partial functions. Two types of computation rules are distinguished: sequential and parallel. The purpose of the paper is to formalize properties (such as termination, correctness and equivalence) of these partial functions by means of the satisfiability or validity of certain formulas in partial function logic.

Descriptors :   (*MATHEMATICAL LOGIC, FUNCTIONS(MATHEMATICS)), ARTIFICIAL INTELLIGENCE, COMPUTER PROGRAMMING, THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE