author | nipkow |
Fri, 10 Sep 2004 00:19:15 +0200 | |
changeset 15195 | 197e00ce3f20 |
parent 15140 | 322485b816ac |
child 15386 | 06757406d8cf |
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 |
||
15131 | 9 |
theory Lfp |
15140 | 10 |
imports Product_Type |
15131 | 11 |
begin |
1558 | 12 |
|
13 |
constdefs |
|
14169 | 14 |
lfp :: "['a set \<Rightarrow> 'a set] \<Rightarrow> 'a set" |
1558 | 15 |
"lfp(f) == Inter({u. f(u) <= u})" (*least fixed point*) |
16 |
||
923 | 17 |
end |