src/HOLCF/Cfun.thy
author huffman
Thu Nov 03 00:57:35 2005 +0100 (2005-11-03)
changeset 18076 e2e626b673b3
parent 17832 e18fc1a9a0e0
child 18078 20e5a6440790
permissions -rw-r--r--
cleaned up; ch2ch_Rep_CFun is a simp rule
huffman@15600
     1
(*  Title:      HOLCF/Cfun.thy
huffman@15576
     2
    ID:         $Id$
huffman@15576
     3
    Author:     Franz Regensburger
huffman@15576
     4
huffman@15576
     5
Definition of the type ->  of continuous functions.
huffman@15576
     6
*)
huffman@15576
     7
huffman@15576
     8
header {* The type of continuous functions *}
huffman@15576
     9
huffman@15577
    10
theory Cfun
huffman@16699
    11
imports Pcpodef
haftmann@16417
    12
uses ("cont_proc.ML")
huffman@15577
    13
begin
huffman@15576
    14
huffman@15576
    15
defaultsort cpo
huffman@15576
    16
huffman@15589
    17
subsection {* Definition of continuous function type *}
huffman@15589
    18
huffman@16699
    19
lemma Ex_cont: "\<exists>f. cont f"
huffman@16699
    20
by (rule exI, rule cont_const)
huffman@16699
    21
huffman@16699
    22
lemma adm_cont: "adm cont"
huffman@16699
    23
by (rule admI, rule cont_lub_fun)
huffman@16699
    24
huffman@17817
    25
cpodef (CFun)  ('a, 'b) "->" (infixr "->" 0) = "{f::'a => 'b. cont f}"
huffman@16699
    26
by (simp add: Ex_cont adm_cont)
huffman@15576
    27
huffman@17816
    28
syntax (xsymbols)
huffman@17816
    29
  "->"     :: "[type, type] => type"      ("(_ \<rightarrow>/ _)" [1,0]0)
huffman@17816
    30
huffman@15576
    31
syntax
huffman@17816
    32
  Rep_CFun :: "('a \<rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b)" ("_$_" [999,1000] 999)
huffman@15576
    33
huffman@15576
    34
syntax (xsymbols)
huffman@17816
    35
  Rep_CFun :: "('a \<rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b)" ("(_\<cdot>_)" [999,1000] 999)
huffman@15576
    36
huffman@15576
    37
syntax (HTML output)
huffman@17816
    38
  Rep_CFun :: "('a \<rightarrow> 'b) \<Rightarrow> ('a \<Rightarrow> 'b)" ("(_\<cdot>_)" [999,1000] 999)
huffman@17816
    39
huffman@17832
    40
subsection {* Syntax for continuous lambda abstraction *}
huffman@17832
    41
huffman@17816
    42
syntax
huffman@17816
    43
  "_cabs" :: "[pttrn, 'a] \<Rightarrow> logic"
huffman@17816
    44
translations
huffman@17816
    45
  "_cabs x t" == "Abs_CFun (%x. t)"
huffman@17816
    46
huffman@17832
    47
text {* To avoid eta-contraction of body: *}
huffman@17816
    48
print_translation {*
huffman@17816
    49
let
huffman@17816
    50
  fun cabs_tr' [Abs abs] =
huffman@17816
    51
    let val (x,t) = atomic_abs_tr' abs
huffman@17816
    52
    in Syntax.const "_cabs" $ x $ t end
huffman@17816
    53
in [("Abs_CFun", cabs_tr')] end
huffman@17816
    54
*}
huffman@17816
    55
huffman@17832
    56
text {* syntax for nested abstractions *}
huffman@17832
    57
huffman@17832
    58
syntax
huffman@17832
    59
  "_Lambda" :: "[pttrns, 'a] \<Rightarrow> logic"  ("(3LAM _./ _)" [0, 10] 10)
huffman@17832
    60
huffman@17832
    61
syntax (xsymbols)
huffman@17832
    62
  "_Lambda" :: "[pttrns, 'a] \<Rightarrow> logic" ("(3\<Lambda>_./ _)" [0, 10] 10)
huffman@17832
    63
huffman@17816
    64
parse_ast_translation {*
huffman@17832
    65
(* rewrites (LAM x y z. t) --> (_cabs x (_cabs y (_cabs z t))) *)
huffman@17816
    66
(* c.f. Syntax.lambda_ast_tr from Syntax/syn_trans.ML *)
huffman@17816
    67
let
huffman@17816
    68
  fun Lambda_ast_tr [pats, body] =
huffman@17816
    69
        Syntax.fold_ast_p "_cabs" (Syntax.unfold_ast "_pttrns" pats, body)
huffman@17832
    70
    | Lambda_ast_tr asts = raise Syntax.AST ("Lambda_ast_tr", asts);
huffman@17816
    71
in [("_Lambda", Lambda_ast_tr)] end
huffman@17816
    72
*}
huffman@17816
    73
huffman@17816
    74
print_ast_translation {*
huffman@17832
    75
(* rewrites (_cabs x (_cabs y (_cabs z t))) --> (LAM x y z. t) *)
huffman@17816
    76
(* c.f. Syntax.abs_ast_tr' from Syntax/syn_trans.ML *)
huffman@17816
    77
let
huffman@17816
    78
  fun cabs_ast_tr' asts =
huffman@17816
    79
    (case Syntax.unfold_ast_p "_cabs"
huffman@17816
    80
        (Syntax.Appl (Syntax.Constant "_cabs" :: asts)) of
huffman@17832
    81
      ([], _) => raise Syntax.AST ("cabs_ast_tr'", asts)
huffman@17816
    82
    | (xs, body) => Syntax.Appl
huffman@17816
    83
        [Syntax.Constant "_Lambda", Syntax.fold_ast "_pttrns" xs, body]);
huffman@17816
    84
in [("_cabs", cabs_ast_tr')] end
huffman@17816
    85
*}
huffman@15641
    86
huffman@17832
    87
subsection {* Continuous function space is pointed *}
huffman@15589
    88
huffman@16098
    89
lemma UU_CFun: "\<bottom> \<in> CFun"
huffman@16098
    90
by (simp add: CFun_def inst_fun_pcpo cont_const)
huffman@16098
    91
huffman@16098
    92
instance "->" :: (cpo, pcpo) pcpo
huffman@16920
    93
by (rule typedef_pcpo [OF type_definition_CFun less_CFun_def UU_CFun])
huffman@16098
    94
huffman@16209
    95
lemmas Rep_CFun_strict =
huffman@16699
    96
  typedef_Rep_strict [OF type_definition_CFun less_CFun_def UU_CFun]
huffman@16209
    97
huffman@16209
    98
lemmas Abs_CFun_strict =
huffman@16699
    99
  typedef_Abs_strict [OF type_definition_CFun less_CFun_def UU_CFun]
huffman@16098
   100
huffman@17832
   101
text {* function application is strict in its first argument *}
huffman@17832
   102
huffman@17832
   103
lemma Rep_CFun_strict1 [simp]: "\<bottom>\<cdot>x = \<bottom>"
huffman@17832
   104
by (simp add: Rep_CFun_strict)
huffman@17832
   105
huffman@17832
   106
text {* for compatibility with old HOLCF-Version *}
huffman@17832
   107
lemma inst_cfun_pcpo: "\<bottom> = (\<Lambda> x. \<bottom>)"
huffman@17832
   108
by (simp add: inst_fun_pcpo [symmetric] Abs_CFun_strict)
huffman@17832
   109
huffman@17832
   110
subsection {* Basic properties of continuous functions *}
huffman@17832
   111
huffman@17832
   112
text {* Beta-equality for continuous functions *}
huffman@16209
   113
huffman@16209
   114
lemma Abs_CFun_inverse2: "cont f \<Longrightarrow> Rep_CFun (Abs_CFun f) = f"
huffman@16209
   115
by (simp add: Abs_CFun_inverse CFun_def)
huffman@16098
   116
huffman@16209
   117
lemma beta_cfun [simp]: "cont f \<Longrightarrow> (\<Lambda> x. f x)\<cdot>u = f u"
huffman@16209
   118
by (simp add: Abs_CFun_inverse2)
huffman@16209
   119
huffman@16209
   120
text {* Eta-equality for continuous functions *}
huffman@16209
   121
huffman@16209
   122
lemma eta_cfun: "(\<Lambda> x. f\<cdot>x) = f"
huffman@16209
   123
by (rule Rep_CFun_inverse)
huffman@16209
   124
huffman@16209
   125
text {* Extensionality for continuous functions *}
huffman@16209
   126
huffman@17832
   127
lemma expand_cfun_eq: "(f = g) = (\<forall>x. f\<cdot>x = g\<cdot>x)"
huffman@17832
   128
by (simp add: Rep_CFun_inject [symmetric] expand_fun_eq)
huffman@17832
   129
huffman@16209
   130
lemma ext_cfun: "(\<And>x. f\<cdot>x = g\<cdot>x) \<Longrightarrow> f = g"
huffman@17832
   131
by (simp add: expand_cfun_eq)
huffman@17832
   132
huffman@17832
   133
text {* Extensionality wrt. ordering for continuous functions *}
huffman@15576
   134
huffman@17832
   135
lemma expand_cfun_less: "f \<sqsubseteq> g = (\<forall>x. f\<cdot>x \<sqsubseteq> g\<cdot>x)" 
huffman@17832
   136
by (simp add: less_CFun_def expand_fun_less)
huffman@17832
   137
huffman@17832
   138
lemma less_cfun_ext: "(\<And>x. f\<cdot>x \<sqsubseteq> g\<cdot>x) \<Longrightarrow> f \<sqsubseteq> g"
huffman@17832
   139
by (simp add: expand_cfun_less)
huffman@17832
   140
huffman@17832
   141
text {* Congruence for continuous function application *}
huffman@15589
   142
huffman@16209
   143
lemma cfun_cong: "\<lbrakk>f = g; x = y\<rbrakk> \<Longrightarrow> f\<cdot>x = g\<cdot>y"
huffman@15589
   144
by simp
huffman@15589
   145
huffman@16209
   146
lemma cfun_fun_cong: "f = g \<Longrightarrow> f\<cdot>x = g\<cdot>x"
huffman@15589
   147
by simp
huffman@15589
   148
huffman@16209
   149
lemma cfun_arg_cong: "x = y \<Longrightarrow> f\<cdot>x = f\<cdot>y"
huffman@15589
   150
by simp
huffman@15589
   151
huffman@16209
   152
subsection {* Continuity of application *}
huffman@15576
   153
huffman@16209
   154
lemma cont_Rep_CFun1: "cont (\<lambda>f. f\<cdot>x)"
huffman@16209
   155
by (rule cont_Rep_CFun [THEN cont2cont_CF1L])
huffman@15576
   156
huffman@16209
   157
lemma cont_Rep_CFun2: "cont (\<lambda>x. f\<cdot>x)"
huffman@16209
   158
apply (rule_tac P = "cont" in CollectD)
huffman@16209
   159
apply (fold CFun_def)
huffman@16209
   160
apply (rule Rep_CFun)
huffman@15576
   161
done
huffman@15576
   162
huffman@16209
   163
lemmas monofun_Rep_CFun = cont_Rep_CFun [THEN cont2mono]
huffman@16209
   164
lemmas contlub_Rep_CFun = cont_Rep_CFun [THEN cont2contlub]
huffman@15589
   165
huffman@16209
   166
lemmas monofun_Rep_CFun1 = cont_Rep_CFun1 [THEN cont2mono, standard]
huffman@16209
   167
lemmas contlub_Rep_CFun1 = cont_Rep_CFun1 [THEN cont2contlub, standard]
huffman@16209
   168
lemmas monofun_Rep_CFun2 = cont_Rep_CFun2 [THEN cont2mono, standard]
huffman@16209
   169
lemmas contlub_Rep_CFun2 = cont_Rep_CFun2 [THEN cont2contlub, standard]
huffman@16209
   170
huffman@16209
   171
text {* contlub, cont properties of @{term Rep_CFun} in each argument *}
huffman@16209
   172
huffman@16209
   173
lemma contlub_cfun_arg: "chain Y \<Longrightarrow> f\<cdot>(lub (range Y)) = (\<Squnion>i. f\<cdot>(Y i))"
huffman@16209
   174
by (rule contlub_Rep_CFun2 [THEN contlubE])
huffman@15576
   175
huffman@16209
   176
lemma cont_cfun_arg: "chain Y \<Longrightarrow> range (\<lambda>i. f\<cdot>(Y i)) <<| f\<cdot>(lub (range Y))"
huffman@16209
   177
by (rule cont_Rep_CFun2 [THEN contE])
huffman@16209
   178
huffman@16209
   179
lemma contlub_cfun_fun: "chain F \<Longrightarrow> lub (range F)\<cdot>x = (\<Squnion>i. F i\<cdot>x)"
huffman@16209
   180
by (rule contlub_Rep_CFun1 [THEN contlubE])
huffman@15576
   181
huffman@16209
   182
lemma cont_cfun_fun: "chain F \<Longrightarrow> range (\<lambda>i. F i\<cdot>x) <<| lub (range F)\<cdot>x"
huffman@16209
   183
by (rule cont_Rep_CFun1 [THEN contE])
huffman@15576
   184
huffman@16209
   185
text {* monotonicity of application *}
huffman@16209
   186
huffman@16209
   187
lemma monofun_cfun_fun: "f \<sqsubseteq> g \<Longrightarrow> f\<cdot>x \<sqsubseteq> g\<cdot>x"
huffman@17832
   188
by (simp add: expand_cfun_less)
huffman@15576
   189
huffman@16209
   190
lemma monofun_cfun_arg: "x \<sqsubseteq> y \<Longrightarrow> f\<cdot>x \<sqsubseteq> f\<cdot>y"
huffman@16209
   191
by (rule monofun_Rep_CFun2 [THEN monofunE])
huffman@15576
   192
huffman@16209
   193
lemma monofun_cfun: "\<lbrakk>f \<sqsubseteq> g; x \<sqsubseteq> y\<rbrakk> \<Longrightarrow> f\<cdot>x \<sqsubseteq> g\<cdot>y"
huffman@16209
   194
by (rule trans_less [OF monofun_cfun_fun monofun_cfun_arg])
huffman@15576
   195
huffman@16209
   196
text {* ch2ch - rules for the type @{typ "'a -> 'b"} *}
huffman@15576
   197
huffman@16209
   198
lemma chain_monofun: "chain Y \<Longrightarrow> chain (\<lambda>i. f\<cdot>(Y i))"
huffman@16209
   199
by (erule monofun_Rep_CFun2 [THEN ch2ch_monofun])
huffman@16209
   200
huffman@16209
   201
lemma ch2ch_Rep_CFunR: "chain Y \<Longrightarrow> chain (\<lambda>i. f\<cdot>(Y i))"
huffman@16209
   202
by (rule monofun_Rep_CFun2 [THEN ch2ch_monofun])
huffman@15576
   203
huffman@16209
   204
lemma ch2ch_Rep_CFunL: "chain F \<Longrightarrow> chain (\<lambda>i. (F i)\<cdot>x)"
huffman@16209
   205
by (rule monofun_Rep_CFun1 [THEN ch2ch_monofun])
huffman@15576
   206
huffman@18076
   207
lemma ch2ch_Rep_CFun [simp]:
huffman@18076
   208
  "\<lbrakk>chain F; chain Y\<rbrakk> \<Longrightarrow> chain (\<lambda>i. (F i)\<cdot>(Y i))"
huffman@15576
   209
apply (rule chainI)
huffman@16209
   210
apply (rule monofun_cfun)
huffman@16209
   211
apply (erule chainE)
huffman@15576
   212
apply (erule chainE)
huffman@15576
   213
done
huffman@15576
   214
huffman@16209
   215
text {* contlub, cont properties of @{term Rep_CFun} in both arguments *}
huffman@15576
   216
huffman@16209
   217
lemma contlub_cfun: 
huffman@16209
   218
  "\<lbrakk>chain F; chain Y\<rbrakk> \<Longrightarrow> (\<Squnion>i. F i)\<cdot>(\<Squnion>i. Y i) = (\<Squnion>i. F i\<cdot>(Y i))"
huffman@18076
   219
by (simp add: contlub_cfun_fun contlub_cfun_arg diag_lub)
huffman@15576
   220
huffman@16209
   221
lemma cont_cfun: 
huffman@16209
   222
  "\<lbrakk>chain F; chain Y\<rbrakk> \<Longrightarrow> range (\<lambda>i. F i\<cdot>(Y i)) <<| (\<Squnion>i. F i)\<cdot>(\<Squnion>i. Y i)"
huffman@16209
   223
apply (rule thelubE)
huffman@16209
   224
apply (simp only: ch2ch_Rep_CFun)
huffman@16209
   225
apply (simp only: contlub_cfun)
huffman@16209
   226
done
huffman@16209
   227
huffman@16209
   228
text {* strictness *}
huffman@16209
   229
huffman@16209
   230
lemma strictI: "f\<cdot>x = \<bottom> \<Longrightarrow> f\<cdot>\<bottom> = \<bottom>"
huffman@16209
   231
apply (rule UU_I)
huffman@15576
   232
apply (erule subst)
huffman@15576
   233
apply (rule minimal [THEN monofun_cfun_arg])
huffman@15576
   234
done
huffman@15576
   235
huffman@16209
   236
text {* the lub of a chain of continous functions is monotone *}
huffman@15576
   237
huffman@16209
   238
lemma lub_cfun_mono: "chain F \<Longrightarrow> monofun (\<lambda>x. \<Squnion>i. F i\<cdot>x)"
huffman@16209
   239
apply (drule ch2ch_monofun [OF monofun_Rep_CFun])
huffman@16209
   240
apply (simp add: thelub_fun [symmetric])
huffman@16209
   241
apply (erule monofun_lub_fun)
huffman@16209
   242
apply (simp add: monofun_Rep_CFun2)
huffman@15576
   243
done
huffman@15576
   244
huffman@16386
   245
text {* a lemma about the exchange of lubs for type @{typ "'a -> 'b"} *}
huffman@15576
   246
huffman@16699
   247
lemma ex_lub_cfun:
huffman@16699
   248
  "\<lbrakk>chain F; chain Y\<rbrakk> \<Longrightarrow> (\<Squnion>j. \<Squnion>i. F j\<cdot>(Y i)) = (\<Squnion>i. \<Squnion>j. F j\<cdot>(Y i))"
huffman@18076
   249
by (simp add: diag_lub)
huffman@15576
   250
huffman@15589
   251
text {* the lub of a chain of cont. functions is continuous *}
huffman@15576
   252
huffman@16209
   253
lemma cont_lub_cfun: "chain F \<Longrightarrow> cont (\<lambda>x. \<Squnion>i. F i\<cdot>x)"
huffman@16209
   254
apply (rule cont2cont_lub)
huffman@16209
   255
apply (erule monofun_Rep_CFun [THEN ch2ch_monofun])
huffman@16209
   256
apply (rule cont_Rep_CFun2)
huffman@15576
   257
done
huffman@15576
   258
huffman@15589
   259
text {* type @{typ "'a -> 'b"} is chain complete *}
huffman@15576
   260
huffman@16920
   261
lemma lub_cfun: "chain F \<Longrightarrow> range F <<| (\<Lambda> x. \<Squnion>i. F i\<cdot>x)"
huffman@16920
   262
by (simp only: contlub_cfun_fun [symmetric] eta_cfun thelubE)
huffman@15576
   263
huffman@16920
   264
lemma thelub_cfun: "chain F \<Longrightarrow> lub (range F) = (\<Lambda> x. \<Squnion>i. F i\<cdot>x)"
huffman@16920
   265
by (rule lub_cfun [THEN thelubI])
huffman@15576
   266
huffman@17832
   267
subsection {* Continuity simplification procedure *}
huffman@15589
   268
huffman@15589
   269
text {* cont2cont lemma for @{term Rep_CFun} *}
huffman@15576
   270
huffman@16209
   271
lemma cont2cont_Rep_CFun:
huffman@16209
   272
  "\<lbrakk>cont f; cont t\<rbrakk> \<Longrightarrow> cont (\<lambda>x. (f x)\<cdot>(t x))"
huffman@16209
   273
by (best intro: cont2cont_app2 cont_const cont_Rep_CFun cont_Rep_CFun2)
huffman@15576
   274
huffman@15589
   275
text {* cont2mono Lemma for @{term "%x. LAM y. c1(x)(y)"} *}
huffman@15576
   276
huffman@15576
   277
lemma cont2mono_LAM:
huffman@15576
   278
assumes p1: "!!x. cont(c1 x)"
huffman@15576
   279
assumes p2: "!!y. monofun(%x. c1 x y)"
huffman@15576
   280
shows "monofun(%x. LAM y. c1 x y)"
huffman@16209
   281
apply (rule monofunI)
huffman@16209
   282
apply (rule less_cfun_ext)
huffman@16209
   283
apply (simp add: p1)
huffman@16209
   284
apply (erule p2 [THEN monofunE])
huffman@15576
   285
done
huffman@15576
   286
huffman@15589
   287
text {* cont2cont Lemma for @{term "%x. LAM y. c1 x y"} *}
huffman@15576
   288
huffman@15576
   289
lemma cont2cont_LAM:
huffman@15576
   290
assumes p1: "!!x. cont(c1 x)"
huffman@15576
   291
assumes p2: "!!y. cont(%x. c1 x y)"
huffman@15576
   292
shows "cont(%x. LAM y. c1 x y)"
huffman@16098
   293
apply (rule cont_Abs_CFun)
huffman@16098
   294
apply (simp add: p1 CFun_def)
huffman@17832
   295
apply (simp add: p2 cont2cont_lambda)
huffman@15576
   296
done
huffman@15576
   297
huffman@16386
   298
text {* continuity simplification procedure *}
huffman@15576
   299
huffman@16055
   300
lemmas cont_lemmas1 =
huffman@16055
   301
  cont_const cont_id cont_Rep_CFun2 cont2cont_Rep_CFun cont2cont_LAM
huffman@16055
   302
huffman@16386
   303
use "cont_proc.ML";
huffman@16386
   304
setup ContProc.setup;
huffman@15576
   305
huffman@15576
   306
(*val cont_tac = (fn i => (resolve_tac cont_lemmas i));*)
huffman@15576
   307
(*val cont_tacR = (fn i => (REPEAT (cont_tac i)));*)
huffman@15576
   308
huffman@17832
   309
subsection {* Miscellaneous *}
huffman@17832
   310
huffman@17832
   311
text {* Monotonicity of @{term Abs_CFun} *}
huffman@15576
   312
huffman@17832
   313
lemma semi_monofun_Abs_CFun:
huffman@17832
   314
  "\<lbrakk>cont f; cont g; f \<sqsubseteq> g\<rbrakk> \<Longrightarrow> Abs_CFun f \<sqsubseteq> Abs_CFun g"
huffman@17832
   315
by (simp add: less_CFun_def Abs_CFun_inverse2)
huffman@15576
   316
huffman@15589
   317
text {* some lemmata for functions with flat/chfin domain/range types *}
huffman@15576
   318
huffman@15576
   319
lemma chfin_Rep_CFunR: "chain (Y::nat => 'a::cpo->'b::chfin)  
huffman@15576
   320
      ==> !s. ? n. lub(range(Y))$s = Y n$s"
huffman@15576
   321
apply (rule allI)
huffman@15576
   322
apply (subst contlub_cfun_fun)
huffman@15576
   323
apply assumption
huffman@15576
   324
apply (fast intro!: thelubI chfin lub_finch2 chfin2finch ch2ch_Rep_CFunL)
huffman@15576
   325
done
huffman@15576
   326
huffman@16085
   327
subsection {* Continuous injection-retraction pairs *}
huffman@15589
   328
huffman@16085
   329
text {* Continuous retractions are strict. *}
huffman@15576
   330
huffman@16085
   331
lemma retraction_strict:
huffman@16085
   332
  "\<forall>x. f\<cdot>(g\<cdot>x) = x \<Longrightarrow> f\<cdot>\<bottom> = \<bottom>"
huffman@15576
   333
apply (rule UU_I)
huffman@16085
   334
apply (drule_tac x="\<bottom>" in spec)
huffman@16085
   335
apply (erule subst)
huffman@16085
   336
apply (rule monofun_cfun_arg)
huffman@16085
   337
apply (rule minimal)
huffman@15576
   338
done
huffman@15576
   339
huffman@16085
   340
lemma injection_eq:
huffman@16085
   341
  "\<forall>x. f\<cdot>(g\<cdot>x) = x \<Longrightarrow> (g\<cdot>x = g\<cdot>y) = (x = y)"
huffman@16085
   342
apply (rule iffI)
huffman@16085
   343
apply (drule_tac f=f in cfun_arg_cong)
huffman@16085
   344
apply simp
huffman@16085
   345
apply simp
huffman@15576
   346
done
huffman@15576
   347
huffman@16314
   348
lemma injection_less:
huffman@16314
   349
  "\<forall>x. f\<cdot>(g\<cdot>x) = x \<Longrightarrow> (g\<cdot>x \<sqsubseteq> g\<cdot>y) = (x \<sqsubseteq> y)"
huffman@16314
   350
apply (rule iffI)
huffman@16314
   351
apply (drule_tac f=f in monofun_cfun_arg)
huffman@16314
   352
apply simp
huffman@16314
   353
apply (erule monofun_cfun_arg)
huffman@16314
   354
done
huffman@16314
   355
huffman@16085
   356
lemma injection_defined_rev:
huffman@16085
   357
  "\<lbrakk>\<forall>x. f\<cdot>(g\<cdot>x) = x; g\<cdot>z = \<bottom>\<rbrakk> \<Longrightarrow> z = \<bottom>"
huffman@16085
   358
apply (drule_tac f=f in cfun_arg_cong)
huffman@16085
   359
apply (simp add: retraction_strict)
huffman@15576
   360
done
huffman@15576
   361
huffman@16085
   362
lemma injection_defined:
huffman@16085
   363
  "\<lbrakk>\<forall>x. f\<cdot>(g\<cdot>x) = x; z \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> g\<cdot>z \<noteq> \<bottom>"
huffman@16085
   364
by (erule contrapos_nn, rule injection_defined_rev)
huffman@16085
   365
huffman@16085
   366
text {* propagation of flatness and chain-finiteness by retractions *}
huffman@16085
   367
huffman@16085
   368
lemma chfin2chfin:
huffman@16085
   369
  "\<forall>y. (f::'a::chfin \<rightarrow> 'b)\<cdot>(g\<cdot>y) = y
huffman@16085
   370
    \<Longrightarrow> \<forall>Y::nat \<Rightarrow> 'b. chain Y \<longrightarrow> (\<exists>n. max_in_chain n Y)"
huffman@16085
   371
apply clarify
huffman@16085
   372
apply (drule_tac f=g in chain_monofun)
huffman@16085
   373
apply (drule chfin [rule_format])
huffman@16085
   374
apply (unfold max_in_chain_def)
huffman@16085
   375
apply (simp add: injection_eq)
huffman@16085
   376
done
huffman@16085
   377
huffman@16085
   378
lemma flat2flat:
huffman@16085
   379
  "\<forall>y. (f::'a::flat \<rightarrow> 'b::pcpo)\<cdot>(g\<cdot>y) = y
huffman@16085
   380
    \<Longrightarrow> \<forall>x y::'b. x \<sqsubseteq> y \<longrightarrow> x = \<bottom> \<or> x = y"
huffman@16085
   381
apply clarify
huffman@16209
   382
apply (drule_tac f=g in monofun_cfun_arg)
huffman@16085
   383
apply (drule ax_flat [rule_format])
huffman@16085
   384
apply (erule disjE)
huffman@16085
   385
apply (simp add: injection_defined_rev)
huffman@16085
   386
apply (simp add: injection_eq)
huffman@15576
   387
done
huffman@15576
   388
huffman@15589
   389
text {* a result about functions with flat codomain *}
huffman@15576
   390
huffman@16085
   391
lemma flat_eqI: "\<lbrakk>(x::'a::flat) \<sqsubseteq> y; x \<noteq> \<bottom>\<rbrakk> \<Longrightarrow> x = y"
huffman@16085
   392
by (drule ax_flat [rule_format], simp)
huffman@16085
   393
huffman@16085
   394
lemma flat_codom:
huffman@16085
   395
  "f\<cdot>x = (c::'b::flat) \<Longrightarrow> f\<cdot>\<bottom> = \<bottom> \<or> (\<forall>z. f\<cdot>z = c)"
huffman@16085
   396
apply (case_tac "f\<cdot>x = \<bottom>")
huffman@15576
   397
apply (rule disjI1)
huffman@15576
   398
apply (rule UU_I)
huffman@16085
   399
apply (erule_tac t="\<bottom>" in subst)
huffman@15576
   400
apply (rule minimal [THEN monofun_cfun_arg])
huffman@16085
   401
apply clarify
huffman@16085
   402
apply (rule_tac a = "f\<cdot>\<bottom>" in refl [THEN box_equals])
huffman@16085
   403
apply (erule minimal [THEN monofun_cfun_arg, THEN flat_eqI])
huffman@16085
   404
apply (erule minimal [THEN monofun_cfun_arg, THEN flat_eqI])
huffman@15589
   405
done
huffman@15589
   406
huffman@15589
   407
huffman@15589
   408
subsection {* Identity and composition *}
huffman@15589
   409
huffman@15589
   410
consts
huffman@16085
   411
  ID      :: "'a \<rightarrow> 'a"
huffman@16085
   412
  cfcomp  :: "('b \<rightarrow> 'c) \<rightarrow> ('a \<rightarrow> 'b) \<rightarrow> 'a \<rightarrow> 'c"
huffman@15589
   413
huffman@16085
   414
syntax  "@oo" :: "['b \<rightarrow> 'c, 'a \<rightarrow> 'b] \<Rightarrow> 'a \<rightarrow> 'c" (infixr "oo" 100)
huffman@15589
   415
     
huffman@18076
   416
translations  "f oo g" == "cfcomp\<cdot>f\<cdot>g"
huffman@15589
   417
huffman@15589
   418
defs
huffman@16085
   419
  ID_def: "ID \<equiv> (\<Lambda> x. x)"
huffman@16085
   420
  oo_def: "cfcomp \<equiv> (\<Lambda> f g x. f\<cdot>(g\<cdot>x))" 
huffman@15589
   421
huffman@16085
   422
lemma ID1 [simp]: "ID\<cdot>x = x"
huffman@16085
   423
by (simp add: ID_def)
huffman@15576
   424
huffman@16085
   425
lemma cfcomp1: "(f oo g) = (\<Lambda> x. f\<cdot>(g\<cdot>x))"
huffman@15589
   426
by (simp add: oo_def)
huffman@15576
   427
huffman@16085
   428
lemma cfcomp2 [simp]: "(f oo g)\<cdot>x = f\<cdot>(g\<cdot>x)"
huffman@15589
   429
by (simp add: cfcomp1)
huffman@15576
   430
huffman@15589
   431
text {*
huffman@15589
   432
  Show that interpretation of (pcpo,@{text "_->_"}) is a category.
huffman@15589
   433
  The class of objects is interpretation of syntactical class pcpo.
huffman@15589
   434
  The class of arrows  between objects @{typ 'a} and @{typ 'b} is interpret. of @{typ "'a -> 'b"}.
huffman@15589
   435
  The identity arrow is interpretation of @{term ID}.
huffman@15589
   436
  The composition of f and g is interpretation of @{text "oo"}.
huffman@15589
   437
*}
huffman@15576
   438
huffman@16085
   439
lemma ID2 [simp]: "f oo ID = f"
huffman@15589
   440
by (rule ext_cfun, simp)
huffman@15576
   441
huffman@16085
   442
lemma ID3 [simp]: "ID oo f = f"
huffman@15589
   443
by (rule ext_cfun, simp)
huffman@15576
   444
huffman@15576
   445
lemma assoc_oo: "f oo (g oo h) = (f oo g) oo h"
huffman@15589
   446
by (rule ext_cfun, simp)
huffman@15576
   447
huffman@16085
   448
huffman@16085
   449
subsection {* Strictified functions *}
huffman@16085
   450
huffman@16085
   451
defaultsort pcpo
huffman@16085
   452
huffman@17815
   453
constdefs
huffman@16085
   454
  strictify  :: "('a \<rightarrow> 'b) \<rightarrow> 'a \<rightarrow> 'b"
huffman@17815
   455
  "strictify \<equiv> (\<Lambda> f x. if x = \<bottom> then \<bottom> else f\<cdot>x)"
huffman@16085
   456
huffman@16085
   457
text {* results about strictify *}
huffman@16085
   458
huffman@17815
   459
lemma cont_strictify1: "cont (\<lambda>f. if x = \<bottom> then \<bottom> else f\<cdot>x)"
huffman@17815
   460
by (simp add: cont_if)
huffman@16085
   461
huffman@17815
   462
lemma monofun_strictify2: "monofun (\<lambda>x. if x = \<bottom> then \<bottom> else f\<cdot>x)"
huffman@17815
   463
apply (rule monofunI)
huffman@17815
   464
apply (auto simp add: monofun_cfun_arg eq_UU_iff [symmetric])
huffman@16085
   465
done
huffman@16085
   466
huffman@17815
   467
(*FIXME: long proof*)
huffman@17815
   468
lemma contlub_strictify2: "contlub (\<lambda>x. if x = \<bottom> then \<bottom> else f\<cdot>x)"
huffman@16209
   469
apply (rule contlubI)
huffman@16085
   470
apply (case_tac "lub (range Y) = \<bottom>")
huffman@16699
   471
apply (drule (1) chain_UU_I)
huffman@18076
   472
apply simp
huffman@17815
   473
apply (simp del: if_image_distrib)
huffman@17815
   474
apply (simp only: contlub_cfun_arg)
huffman@16085
   475
apply (rule lub_equal2)
huffman@16085
   476
apply (rule chain_mono2 [THEN exE])
huffman@16085
   477
apply (erule chain_UU_I_inverse2)
huffman@16085
   478
apply (assumption)
huffman@17815
   479
apply (rule_tac x=x in exI, clarsimp)
huffman@16085
   480
apply (erule chain_monofun)
huffman@17815
   481
apply (erule monofun_strictify2 [THEN ch2ch_monofun])
huffman@16085
   482
done
huffman@16085
   483
huffman@17815
   484
lemmas cont_strictify2 =
huffman@17815
   485
  monocontlub2cont [OF monofun_strictify2 contlub_strictify2, standard]
huffman@17815
   486
huffman@17815
   487
lemma strictify_conv_if: "strictify\<cdot>f\<cdot>x = (if x = \<bottom> then \<bottom> else f\<cdot>x)"
huffman@17815
   488
by (unfold strictify_def, simp add: cont_strictify1 cont_strictify2)
huffman@16085
   489
huffman@16085
   490
lemma strictify1 [simp]: "strictify\<cdot>f\<cdot>\<bottom> = \<bottom>"
huffman@17815
   491
by (simp add: strictify_conv_if)
huffman@16085
   492
huffman@16085
   493
lemma strictify2 [simp]: "x \<noteq> \<bottom> \<Longrightarrow> strictify\<cdot>f\<cdot>x = f\<cdot>x"
huffman@17815
   494
by (simp add: strictify_conv_if)
huffman@16085
   495
huffman@17816
   496
subsection {* Continuous let-bindings *}
huffman@17816
   497
huffman@17816
   498
constdefs
huffman@17816
   499
  CLet :: "'a \<rightarrow> ('a \<rightarrow> 'b) \<rightarrow> 'b"
huffman@17816
   500
  "CLet \<equiv> \<Lambda> s f. f\<cdot>s"
huffman@17816
   501
huffman@17816
   502
syntax
huffman@17816
   503
  "_CLet" :: "[letbinds, 'a] => 'a" ("(Let (_)/ in (_))" 10)
huffman@17816
   504
huffman@17816
   505
translations
huffman@17816
   506
  "_CLet (_binds b bs) e" == "_CLet b (_CLet bs e)"
huffman@18076
   507
  "Let x = a in e" == "CLet\<cdot>a\<cdot>(\<Lambda> x. e)"
huffman@17816
   508
huffman@15576
   509
end