src/CCL/Lfp.thy
author clasohm
Thu Sep 16 12:20:38 1993 +0200 (1993-09-16)
changeset 0 a5a9c433f639
child 1474 3f7d67927fe2
permissions -rw-r--r--
Initial revision
clasohm@0
     1
(*  Title: 	HOL/lfp.thy
clasohm@0
     2
    ID:         $Id$
clasohm@0
     3
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1992  University of Cambridge
clasohm@0
     5
clasohm@0
     6
The Knaster-Tarski Theorem
clasohm@0
     7
*)
clasohm@0
     8
clasohm@0
     9
Lfp = Set +
clasohm@0
    10
consts lfp :: "['a set=>'a set] => 'a set"
clasohm@0
    11
rules
clasohm@0
    12
 (*least fixed point*)
clasohm@0
    13
 lfp_def "lfp(f) == Inter({u. f(u) <= u})"
clasohm@0
    14
end