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