author | nipkow |
Mon, 16 Aug 2004 14:22:27 +0200 | |
changeset 15131 | c69542757a4d |
parent 14169 | 0590de71a016 |
child 15140 | 322485b816ac |
permissions | -rw-r--r-- |
1475 | 1 |
(* Title: HOL/gfp.thy |
923 | 2 |
ID: $Id$ |
1475 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
923 | 4 |
Copyright 1994 University of Cambridge |
5 |
||
6 |
Greatest fixed points (requires Lfp too!) |
|
7 |
*) |
|
8 |
||
15131 | 9 |
theory Gfp |
10 |
import Lfp |
|
11 |
begin |
|
1558 | 12 |
|
13 |
constdefs |
|
14169 | 14 |
gfp :: "['a set=>'a set] => 'a set" |
1558 | 15 |
"gfp(f) == Union({u. u <= f(u)})" (*greatest fixed point*) |
16 |
||
923 | 17 |
end |