author | webertj |
Thu, 18 Nov 2004 18:46:09 +0100 | |
changeset 15297 | 0aff5d912422 |
parent 15140 | 322485b816ac |
child 15381 | 780ea4c697f2 |
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 imports Lfp begin constdefs gfp :: "['a set=>'a set] => 'a set" "gfp(f) == Union({u. u <= f(u)})" (*greatest fixed point*) end