author | wenzelm |
Fri, 07 Mar 1997 15:03:57 +0100 | |
changeset 2762 | 2ade3a141934 |
parent 1558 | 9c6ebfab4e05 |
child 3947 | eb707467f8c5 |
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