Lfp.thy
author nipkow
Wed, 30 Mar 1994 10:00:23 +0200
changeset 64 ee7413a7a44a
parent 0 7949f97df77a
child 116 ab4328bbff70
permissions -rw-r--r--
@ now associates to the right, just like #, in order to avoid loss of parentheses due to pretty printer.

(*  Title: 	HOL/lfp.thy
    ID:         $Id$
    Author: 	Lawrence C Paulson, Cambridge University Computer Laboratory
    Copyright   1992  University of Cambridge

The Knaster-Tarski Theorem
*)

Lfp = Sum +
consts lfp :: "['a set=>'a set] => 'a set"
rules
 (*least fixed point*)
 lfp_def "lfp(f) == Inter({u. f(u) <= u})"
end