Advertisement

Fixed Points

  • Ralph-Johan Back
  • Joakim von Wright
Part of the Graduate Texts in Computer Science book series (TCS)

Abstract

The statement constructors that we have introduced earlier — sequential composition, join, and meet — are all monotonic with respect to the refinement relation on Mtran. Hence, we can use these constructs to define monotonic functions from the complete lattice of predicate transformers to itself.

Keywords

Monotonic Function Complete Lattice Induction Assumption Denotational Semantic Predicate Transformer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Ralph-Johan Back
    • 1
  • Joakim von Wright
    • 1
  1. 1.Department of Computer ScienceÅbo Akademi UniversityTurkuFinland

Personalised recommendations