src/HOL/UNITY/Follows.thy

Theory of the "Follows" relation

(*  Title:      HOL/UNITY/Follows
    ID:         $Id$
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
    Copyright   1998  University of Cambridge

The Follows relation of Charpentier and Sivilotte
*)

Follows = Union +

constdefs

  Follows :: "['a => 'b::{order}, 'a => 'b::{order}] => 'a program set"
                 (infixl 65)
   "f Follows g == Increasing g Int Increasing f Int
                   Always {s. f s <= g s} Int
                   (INT k. {s. k <= g s} LeadsTo {s. k <= f s})"


end