author | clasohm |
Thu, 08 Dec 1994 12:50:38 +0100 | |
changeset 199 | ad45e477926c |
parent 178 | 12dd5d2e266b |
permissions | -rw-r--r-- |
0 | 1 |
(* Title: HOL/gfp.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
116 | 4 |
Copyright 1994 University of Cambridge |
0 | 5 |
|
116 | 6 |
Greatest fixed points (requires Lfp too!) |
0 | 7 |
*) |
8 |
||
9 |
Gfp = Lfp + |
|
10 |
consts gfp :: "['a set=>'a set] => 'a set" |
|
178 | 11 |
defs |
0 | 12 |
(*greatest fixed point*) |
13 |
gfp_def "gfp(f) == Union({u. u <= f(u)})" |
|
14 |
end |