author | wenzelm |
Thu, 14 Dec 2000 19:36:48 +0100 | |
changeset 10671 | ac6b3b671198 |
parent 10212 | 33fe2d701ddd |
child 11609 | 3f3d1add4d94 |
permissions | -rw-r--r-- |
1475 | 1 |
(* Title: HOL/Lfp.thy |
923 | 2 |
ID: $Id$ |
1475 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
923 | 4 |
Copyright 1992 University of Cambridge |
5 |
||
6 |
The Knaster-Tarski Theorem |
|
7 |
*) |
|
8 |
||
10212 | 9 |
Lfp = mono + Product_Type + |
1558 | 10 |
|
11 |
constdefs |
|
12 |
lfp :: ['a set=>'a set] => 'a set |
|
13 |
"lfp(f) == Inter({u. f(u) <= u})" (*least fixed point*) |
|
14 |
||
923 | 15 |
end |