Report Number: CS-TR-76-542
Institution: Stanford University, Department of Computer Science
Title: The theoretical aspects of the optimal fixedpoint
Author: Manna, Z ohar
Author: Shamir, Adi
Date: March 1976
Abstract: In thls paper we define a new type of fixedpoint of recursive definitions and investigate some of its properties. This optimal fixedpoint (which always uniquely exists) contains, in some sense, the maximal amount of "interesting" information which can be extracted from the recursive definition, and it may be strictly more defined than the program's least fixedpoint. This fixedpoint can be the basis for assigning a new semantics to recursive programs. This is a modified and extended version of part 1 of a paper presented at the Symposium on Theory of Computing, Albuquerque, New Mexico (May 1975).