author | wenzelm |
Wed, 14 Jun 2000 17:59:53 +0200 | |
changeset 9066 | b1e874e38dab |
parent 8882 | 9df44a4f1bf7 |
child 14169 | 0590de71a016 |
permissions | -rw-r--r-- |
(* 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!) *) Gfp = Lfp + constdefs gfp :: ['a set=>'a set] => 'a set "gfp(f) == Union({u. u <= f(u)})" (*greatest fixed point*) end