| author | ballarin | 
| Fri, 14 Mar 2003 18:00:16 +0100 | |
| changeset 13864 | f44f121dd275 | 
| parent 8882 | 9df44a4f1bf7 | 
| child 14169 | 0590de71a016 | 
| 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 | ||
| 9 | Gfp = Lfp + | |
| 1558 | 10 | |
| 11 | constdefs | |
| 12 | gfp :: ['a set=>'a set] => 'a set | |
| 13 |   "gfp(f) == Union({u. u <= f(u)})"    (*greatest fixed point*)
 | |
| 14 | ||
| 923 | 15 | end |