src/HOLCF/Cfun1.thy
author paulson
Sat, 10 Jan 1998 17:59:32 +0100
changeset 4552 bb8ff763c93d
parent 4121 390e10ddadf2
child 5291 5706f0ef1d43
permissions -rw-r--r--
Simplified proofs by omitting PA = {|XA, ...|} from RA2

(*  Title:      HOLCF/cfun1.thy
    ID:         $Id$
    Author:     Franz Regensburger
    Copyright   1993 Technische Universitaet Muenchen

Definition of the type ->  of continuous functions

*)

Cfun1 = Cont +

default cpo

typedef (CFun)  ('a, 'b) "->" (infixr 0) = "{f. cont f}" (CfunI)

(* to make << defineable *)
instance "->"  :: (cpo,cpo)sq_ord

consts  
        fapp      :: "('a -> 'b)=>('a => 'b)" ("_`_" [999,1000] 999)
					        (* usually Rep_Cfun *)
                                                (* application      *)
        fabs      :: "('a => 'b)=>('a -> 'b)"     (binder "LAM " 10)
                                                (* usually Abs_Cfun *)
                                                (* abstraction      *)
        less_cfun :: "[('a -> 'b),('a -> 'b)]=>bool"

syntax (symbols)
  "->"		:: [type, type] => type	("(_ \\<rightarrow>/ _)" [1,0]0)
  "LAM "	:: "[idts, 'a => 'b] => ('a -> 'b)"
					("(3\\<Lambda>_./ _)" [0, 10] 10)
defs 
  fabs_def	"fabs==Abs_CFun"
  fapp_def	"fapp==Rep_CFun"

  less_cfun_def "(op <<) == (% fo1 fo2. fapp fo1 << fapp fo2 )"

end