author | regensbu |
Fri, 06 Oct 1995 16:17:08 +0100 | |
changeset 1273 | 6960ec882bca |
parent 923 | ff1574a81019 |
child 1370 | 7361ac9b024d |
permissions | -rw-r--r-- |
923 | 1 |
(* Title: HOL/gfp.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1994 University of Cambridge |
|
5 |
||
6 |
Greatest fixed points (requires Lfp too!) |
|
7 |
*) |
|
8 |
||
9 |
Gfp = Lfp + |
|
10 |
consts gfp :: "['a set=>'a set] => 'a set" |
|
11 |
defs |
|
12 |
(*greatest fixed point*) |
|
13 |
gfp_def "gfp(f) == Union({u. u <= f(u)})" |
|
14 |
end |