author | skalberg |
Wed, 27 Aug 2003 18:13:59 +0200 | |
changeset 14169 | 0590de71a016 |
parent 8882 | 9df44a4f1bf7 |
child 15131 | c69542757a4d |
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!) *) theory Gfp = Lfp: constdefs gfp :: "['a set=>'a set] => 'a set" "gfp(f) == Union({u. u <= f(u)})" (*greatest fixed point*) end