src/HOL/Lfp.thy
author berghofe
Tue, 30 May 2000 18:02:49 +0200
changeset 9001 93af64f54bf2
parent 8882 9df44a4f1bf7
child 10212 33fe2d701ddd
permissions -rw-r--r--
the is now defined using primrec, avoiding explicit use of arbitrary.

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

The Knaster-Tarski Theorem
*)

Lfp = mono + Prod +

constdefs
  lfp :: ['a set=>'a set] => 'a set
  "lfp(f) == Inter({u. f(u) <= u})"    (*least fixed point*)

end