BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-76-542
       ENTRY:: July 04, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: The theoretical aspects of the optimal fixedpoint
        TYPE:: Technical Report
      AUTHOR:: Manna, Zohar
      AUTHOR:: Shamir, Adi
        DATE:: March 1976
       PAGES:: 26
    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).
       NOTES:: [Adminitrivia V1/Prg/19950704]
         END:: STAN//CS-TR-76-542