src/HOL/Gfp.thy
author obua
Sun, 09 May 2004 23:04:36 +0200
changeset 14722 8e739a6eaf11
parent 14169 0590de71a016
child 15131 c69542757a4d
permissions -rw-r--r--
replaced apply-style proof for instance Multiset :: plus_ac0 by recommended Isar proof style

(*  Title:      HOL/gfp.thy
    ID:         $Id$
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
    Copyright   1994  University of Cambridge

Greatest fixed points (requires Lfp too!)
*)

theory Gfp = Lfp:

constdefs
  gfp :: "['a set=>'a set] => 'a set"
  "gfp(f) == Union({u. u <= f(u)})"    (*greatest fixed point*)

end