The Theoretical Aspects of the Optimal Fixedpoint

Abstract

In this paper the authors 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1976
Accession Number
ADA027454

Entities

People

  • Adi Shamir
  • Zohar Manna

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Artificial Intelligence
  • Classification
  • Computations
  • Computer Science
  • Contracts
  • Equations
  • Formal Languages
  • Hierarchies
  • Identities
  • Language
  • Mathematics
  • Recursive Functions
  • Structural Properties
  • Theory Of Computation
  • Universities

Readers

  • Mathematical Modeling and Probability Theory.