author | clasohm |
Thu, 29 Jun 1995 12:29:58 +0200 | |
changeset 250 | 093e273405f0 |
parent 178 | 12dd5d2e266b |
permissions | -rw-r--r-- |
0 | 1 |
(* Title: HOL/lfp.thy |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
4 |
Copyright 1992 University of Cambridge |
|
5 |
||
6 |
The Knaster-Tarski Theorem |
|
7 |
*) |
|
8 |
||
116 | 9 |
Lfp = mono + |
0 | 10 |
consts lfp :: "['a set=>'a set] => 'a set" |
178 | 11 |
defs |
0 | 12 |
(*least fixed point*) |
13 |
lfp_def "lfp(f) == Inter({u. f(u) <= u})" |
|
14 |
end |