author | kleing |
Mon, 19 Apr 2004 09:31:00 +0200 | |
changeset 14626 | dfb8d2977263 |
parent 14169 | 0590de71a016 |
child 15131 | c69542757a4d |
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 |
||
14169 | 9 |
theory Gfp = Lfp: |
1558 | 10 |
|
11 |
constdefs |
|
14169 | 12 |
gfp :: "['a set=>'a set] => 'a set" |
1558 | 13 |
"gfp(f) == Union({u. u <= f(u)})" (*greatest fixed point*) |
14 |
||
923 | 15 |
end |