author | nipkow |
Thu, 24 Nov 1994 20:00:52 +0100 | |
changeset 176 | 363bddd82ffe |
parent 116 | ab4328bbff70 |
child 178 | 12dd5d2e266b |
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" rules (*greatest fixed point*) gfp_def "gfp(f) == Union({u. u <= f(u)})" end