PROPERTIES OF PROGRAMS AND PARTIAL FUNCTION LOGIC,
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1969
- Accession Number
- AD0708071
Entities
People
- John McCarthy
- Zohar Manna
Organizations
- Stanford University