author | clasohm |
Thu, 22 Feb 1996 12:20:34 +0100 | |
changeset 1516 | 96286c4e32de |
parent 1475 | 7f5a4cd08209 |
child 1558 | 9c6ebfab4e05 |
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 + consts gfp :: ['a set=>'a set] => 'a set defs (*greatest fixed point*) gfp_def "gfp(f) == Union({u. u <= f(u)})" end