src/CCL/Gfp.thy
author paulson
Wed, 09 Oct 1996 13:32:33 +0200
changeset 2073 fb0655539d05
parent 1474 3f7d67927fe2
child 17456 bcf7544875b2
permissions -rw-r--r--
New unified treatment of sequent calculi by Sara Kalvala combines the old LK and Modal with the new ILL (Int. Linear Logic)

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

Greatest fixed points
*)

Gfp = Lfp +
consts gfp :: "['a set=>'a set] => 'a set"
rules
 (*greatest fixed point*)
 gfp_def "gfp(f) == Union({u. u <= f(u)})"
end