author | nipkow |
Wed, 29 Nov 2000 13:44:26 +0100 | |
changeset 10538 | d1bf9ca9008d |
parent 0 | a5a9c433f639 |
permissions | -rw-r--r-- |
0 | 1 |
(* Title: HOL/gfp.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1992 University of Cambridge |
|
5 |
||
6 |
Greatest fixed points |
|
7 |
*) |
|
8 |
||
9 |
Gfp = Lfp + |
|
10 |
consts gfp :: "['a set=>'a set] => 'a set" |
|
11 |
rules |
|
12 |
(*greatest fixed point*) |
|
13 |
gfp_def "gfp(f) == Union({u. u <= f(u)})" |
|
14 |
end |