1261
853abc14c5c6
added IsaMakefile...but so far included only a test for the parser
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 1
theory Parser
1309
+ − 2
imports "Nominal2_Atoms" "Nominal2_Eqvt" "Nominal2_Supp" "Perm" "Fv" "Rsp"
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 3
begin
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 4
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 5
atom_decl name
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 6
1194
+ − 7
section{* Interface for nominal_datatype *}
+ − 8
+ − 9
text {*
+ − 10
+ − 11
Nominal-Datatype-part:
+ − 12
+ − 13
1266
+ − 14
1nd Arg: (string list * binding * mixfix * (binding * typ list * mixfix) list) list
1194
+ − 15
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+ − 16
type(s) to be defined constructors list
+ − 17
(ty args, name, syn) (name, typs, syn)
+ − 18
+ − 19
Binder-Function-part:
+ − 20
1266
+ − 21
2rd Arg: (binding * typ option * mixfix) list
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 22
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1194
+ − 23
binding function(s)
+ − 24
to be defined
+ − 25
(name, type, syn)
+ − 26
1266
+ − 27
3th Arg: term list
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 28
^^^^^^^^^
1194
+ − 29
the equations of the binding functions
+ − 30
(Trueprop equations)
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 31
*}
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 32
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 33
ML {*
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 34
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 35
*}
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 36
1194
+ − 37
text {*****************************************************}
+ − 38
ML {*
+ − 39
(* nominal datatype parser *)
+ − 40
local
+ − 41
structure P = OuterParse
1266
+ − 42
+ − 43
fun tuple ((x, y, z), u) = (x, y, z, u)
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 44
fun tswap (((x, y), z), u) = (x, y, u, z)
1194
+ − 45
in
+ − 46
+ − 47
val _ = OuterKeyword.keyword "bind"
+ − 48
val anno_typ = Scan.option (P.name --| P.$$$ "::") -- P.typ
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 49
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 50
(* binding specification *)
1266
+ − 51
(* maybe use and_list *)
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 52
val bind_parser =
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 53
P.enum "," ((P.$$$ "bind" |-- P.term) -- (P.$$$ "in" |-- P.name) >> swap)
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 54
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 55
val constr_parser =
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 56
P.binding -- Scan.repeat anno_typ
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 57
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 58
(* datatype parser *)
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 59
val dt_parser =
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 60
(P.type_args -- P.binding -- P.opt_mixfix >> P.triple1) --
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 61
(P.$$$ "=" |-- P.enum1 "|" (constr_parser -- bind_parser -- P.opt_mixfix >> tswap)) >> tuple
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 62
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 63
(* function equation parser *)
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 64
val fun_parser =
1194
+ − 65
Scan.optional (P.$$$ "binder" |-- P.fixes -- SpecParse.where_alt_specs) ([],[])
+ − 66
+ − 67
(* main parser *)
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 68
val main_parser =
1266
+ − 69
(P.and_list1 dt_parser) -- fun_parser >> P.triple2
1194
+ − 70
+ − 71
end
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 72
*}
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 73
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 74
(* adds "_raw" to the end of constants and types *)
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 75
ML {*
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 76
fun add_raw s = s ^ "_raw"
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 77
fun add_raws ss = map add_raw ss
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 78
fun raw_bind bn = Binding.suffix_name "_raw" bn
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 79
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 80
fun replace_str ss s =
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 81
case (AList.lookup (op=) ss s) of
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 82
SOME s' => s'
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 83
| NONE => s
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 84
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 85
fun replace_typ ty_ss (Type (a, Ts)) = Type (replace_str ty_ss a, map (replace_typ ty_ss) Ts)
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 86
| replace_typ ty_ss T = T
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 87
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 88
fun raw_dts ty_ss dts =
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 89
let
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 90
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 91
fun raw_dts_aux1 (bind, tys, mx) =
1289
+ − 92
(raw_bind bind, map (replace_typ ty_ss) tys, mx)
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 93
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 94
fun raw_dts_aux2 (ty_args, bind, mx, constrs) =
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 95
(ty_args, raw_bind bind, mx, map raw_dts_aux1 constrs)
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 96
in
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 97
map raw_dts_aux2 dts
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 98
end
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 99
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 100
fun replace_aterm trm_ss (Const (a, T)) = Const (replace_str trm_ss a, T)
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 101
| replace_aterm trm_ss (Free (a, T)) = Free (replace_str trm_ss a, T)
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 102
| replace_aterm trm_ss trm = trm
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 103
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 104
fun replace_term trm_ss ty_ss trm =
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 105
trm |> Term.map_aterms (replace_aterm trm_ss) |> map_types (replace_typ ty_ss)
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 106
*}
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 107
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 108
ML {*
1289
+ − 109
fun get_cnstrs dts =
1290
+ − 110
map (fn (_, _, _, constrs) => constrs) dts
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 111
1289
+ − 112
fun get_typed_cnstrs dts =
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 113
flat (map (fn (_, bn, _, constrs) =>
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 114
(map (fn (bn', _, _) => (Binding.name_of bn, Binding.name_of bn')) constrs)) dts)
1232
35bc8f7b66f8
parsing of function definitions almost works now; still an error with undefined constants
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 115
1289
+ − 116
fun get_cnstr_strs dts =
1290
+ − 117
map (fn (bn, _, _) => Binding.name_of bn) (flat (get_cnstrs dts))
1232
35bc8f7b66f8
parsing of function definitions almost works now; still an error with undefined constants
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 118
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 119
fun get_bn_fun_strs bn_funs =
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 120
map (fn (bn_fun, _, _) => Binding.name_of bn_fun) bn_funs
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 121
*}
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 122
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 123
ML {*
1289
+ − 124
fun rawify_dts dt_names dts dts_env =
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 125
let
1289
+ − 126
val raw_dts = raw_dts dts_env dts
1287
+ − 127
val raw_dt_names = add_raws dt_names
1228
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 128
in
1287
+ − 129
(raw_dt_names, raw_dts)
1228
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 130
end
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 131
*}
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 132
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 133
ML {*
1289
+ − 134
fun rawify_bn_funs dts_env cnstrs_env bn_fun_env bn_funs bn_eqs =
+ − 135
let
+ − 136
val bn_funs' = map (fn (bn, ty, mx) =>
+ − 137
(raw_bind bn, replace_typ dts_env ty, mx)) bn_funs
+ − 138
+ − 139
val bn_eqs' = map (fn (attr, trm) =>
+ − 140
(attr, replace_term (cnstrs_env @ bn_fun_env) dts_env trm)) bn_eqs
+ − 141
in
+ − 142
(bn_funs', bn_eqs')
+ − 143
end
+ − 144
*}
+ − 145
+ − 146
ML {*
1293
+ − 147
fun rawify_binds dts_env cnstrs_env bn_fun_env binds =
+ − 148
map (map (map (map (fn (opt_trm, i, j) =>
1375
aa787c9b6955
A version of Fv that takes into account recursive and non-recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 149
(Option.map (apfst (replace_term (cnstrs_env @ bn_fun_env) dts_env)) opt_trm, i, j))))) binds
1293
+ − 150
*}
+ − 151
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 152
ML {*
1392
+ − 153
fun find [] _ = error ("cannot find element")
+ − 154
| find ((x, z)::xs) y = if (Long_Name.base_name x) = y then z else find xs y
+ − 155
*}
+ − 156
+ − 157
ML {*
1403
4a10338c2535
almost done with showing the equivalence between old and new alpha-equivalence (one subgoal remaining)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 158
fun prep_bn dt_names dts eqs =
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 159
let
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 160
fun aux eq =
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 161
let
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 162
val (lhs, rhs) = eq
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 163
|> strip_qnt_body "all"
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 164
|> HOLogic.dest_Trueprop
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 165
|> HOLogic.dest_eq
1392
+ − 166
val (bn_fun, [cnstr]) = strip_comb lhs
+ − 167
val (_, ty) = dest_Free bn_fun
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 168
val (ty_name, _) = dest_Type (domain_type ty)
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 169
val dt_index = find_index (fn x => x = ty_name) dt_names
1392
+ − 170
val (cnstr_head, cnstr_args) = strip_comb cnstr
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 171
val included = map (fn i => length (cnstr_args) - i - 1) (loose_bnos rhs)
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 172
in
1392
+ − 173
(dt_index, (bn_fun, (cnstr_head, included)))
+ − 174
end
+ − 175
+ − 176
fun order dts i ts =
+ − 177
let
+ − 178
val dt = nth dts i
+ − 179
val cts = map (fn (x, _, _) => Binding.name_of x) ((fn (_, _, _, x) => x) dt)
+ − 180
val ts' = map (fn (x, y) => (fst (dest_Const x), y)) ts
+ − 181
in
+ − 182
map (find ts') cts
+ − 183
end
+ − 184
+ − 185
val unordered = AList.group (op=) (map aux eqs)
+ − 186
val unordered' = map (fn (x, y) => (x, AList.group (op=) y)) unordered
+ − 187
val ordered = map (fn (x, y) => (x, map (fn (v, z) => (v, order dts x z)) y)) unordered'
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 188
in
1392
+ − 189
ordered
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 190
end
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 191
*}
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 192
1293
+ − 193
ML {*
1289
+ − 194
fun add_primrec_wrapper funs eqs lthy =
+ − 195
if null funs then (([], []), lthy)
+ − 196
else
+ − 197
let
+ − 198
val eqs' = map (fn (_, eq) => (Attrib.empty_binding, eq)) eqs
+ − 199
val funs' = map (fn (bn, ty, mx) => (bn, SOME ty, mx)) funs
+ − 200
in
+ − 201
Primrec.add_primrec funs' eqs' lthy
+ − 202
end
+ − 203
*}
+ − 204
1293
+ − 205
ML {*
+ − 206
fun add_datatype_wrapper dt_names dts =
+ − 207
let
+ − 208
val conf = Datatype.default_config
+ − 209
in
+ − 210
Local_Theory.theory_result (Datatype.add_datatype conf dt_names dts)
+ − 211
end
+ − 212
*}
1289
+ − 213
+ − 214
ML {*
1293
+ − 215
fun raw_nominal_decls dts bn_funs bn_eqs binds lthy =
1228
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 216
let
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 217
val thy = ProofContext.theory_of lthy
1289
+ − 218
val thy_name = Context.theory_name thy
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 219
1289
+ − 220
val dt_names = map (fn (_, s, _, _) => Binding.name_of s) dts
+ − 221
val dt_full_names = map (Long_Name.qualify thy_name) dt_names
+ − 222
val dt_full_names' = add_raws dt_full_names
+ − 223
val dts_env = dt_full_names ~~ dt_full_names'
+ − 224
+ − 225
val cnstrs = get_cnstr_strs dts
+ − 226
val cnstrs_ty = get_typed_cnstrs dts
+ − 227
val cnstrs_full_names = map (Long_Name.qualify thy_name) cnstrs
+ − 228
val cnstrs_full_names' = map (fn (x, y) => Long_Name.qualify thy_name
+ − 229
(Long_Name.qualify (add_raw x) (add_raw y))) cnstrs_ty
+ − 230
val cnstrs_env = cnstrs_full_names ~~ cnstrs_full_names'
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 231
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 232
val bn_fun_strs = get_bn_fun_strs bn_funs
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 233
val bn_fun_strs' = add_raws bn_fun_strs
1266
+ − 234
val bn_fun_env = bn_fun_strs ~~ bn_fun_strs'
1293
+ − 235
val bn_fun_full_env = map (pairself (Long_Name.qualify thy_name))
+ − 236
(bn_fun_strs ~~ bn_fun_strs')
+ − 237
1289
+ − 238
val (raw_dt_names, raw_dts) = rawify_dts dt_names dts dts_env
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 239
1289
+ − 240
val (raw_bn_funs, raw_bn_eqs) = rawify_bn_funs dts_env cnstrs_env bn_fun_env bn_funs bn_eqs
1293
+ − 241
+ − 242
val raw_binds = rawify_binds dts_env cnstrs_env bn_fun_full_env binds
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 243
1403
4a10338c2535
almost done with showing the equivalence between old and new alpha-equivalence (one subgoal remaining)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 244
val raw_bns = prep_bn dt_full_names' raw_dts (map snd raw_bn_eqs)
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 245
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 246
(*val _ = tracing (cat_lines (map PolyML.makestring raw_bns))*)
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 247
in
1289
+ − 248
lthy
1293
+ − 249
|> add_datatype_wrapper raw_dt_names raw_dts
1289
+ − 250
||>> add_primrec_wrapper raw_bn_funs raw_bn_eqs
1293
+ − 251
||>> pair raw_binds
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 252
||>> pair raw_bns
1293
+ − 253
end
+ − 254
*}
+ − 255
1422
+ − 256
ML {*
+ − 257
fun un_raw name = unprefix "_raw" name handle Fail _ => name
+ − 258
fun add_under names = hd names :: (map (prefix "_") (tl names))
+ − 259
fun un_raws name = implode (map un_raw (add_under (space_explode "_" name)))
+ − 260
val un_raw_names = rename_vars un_raws
+ − 261
fun lift_thm ctxt thm = un_raw_names (snd (Quotient_Tacs.lifted_attrib (Context.Proof ctxt, thm)))
+ − 262
*}
1293
+ − 263
1341
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 264
lemma equivp_hack: "equivp x"
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 265
sorry
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 266
ML {*
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 267
fun equivp_hack ctxt rel =
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 268
let
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 269
val thy = ProofContext.theory_of ctxt
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 270
val ty = domain_type (fastype_of rel)
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 271
val cty = ctyp_of thy ty
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 272
val ct = cterm_of thy rel
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 273
in
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 274
Drule.instantiate' [SOME cty] [SOME ct] @{thm equivp_hack}
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 275
end
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 276
*}
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 277
1420
+ − 278
(* These 2 are critical, we don't know how to do it in term5 *)
1416
+ − 279
ML {* val cheat_fv_rsp = ref true *}
1420
+ − 280
ML {* val cheat_const_rsp = ref true *} (* For alpha_bn 0 and alpha_bn_rsp *)
1416
+ − 281
1443
+ − 282
ML {* val cheat_equivp = ref true *}
+ − 283
1420
+ − 284
(* Fixes for these 2 are known *)
+ − 285
ML {* val cheat_fv_eqvt = ref true *} (* The tactic works, building the goal needs fixing *)
+ − 286
ML {* val cheat_alpha_eqvt = ref true *} (* The tactic works, building the goal needs fixing *)
1341
c25f797c7e6e
Added lifting of pseudo-injectivity, commented out the code again and enabled the weird examples.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 287
1428
+ − 288
1346
+ − 289
ML {*
1293
+ − 290
fun nominal_datatype2 dts bn_funs bn_eqs binds lthy =
+ − 291
let
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 292
val _ = tracing "Raw declarations";
1340
+ − 293
val thy = ProofContext.theory_of lthy
+ − 294
val thy_name = Context.theory_name thy
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 295
val ((((raw_dt_names, (raw_bn_funs_loc, raw_bn_eqs_loc)), raw_binds), raw_bns), lthy2) =
1293
+ − 296
raw_nominal_decls dts bn_funs bn_eqs binds lthy
1396
+ − 297
val morphism_2_1 = ProofContext.export_morphism lthy2 lthy
+ − 298
val raw_bns_exp = map (apsnd (map (apfst (Morphism.term morphism_2_1)))) raw_bns;
+ − 299
val bn_funs_decls = flat (map (fn (ith, l) => map (fn (bn, data) => (bn, ith, data)) l) raw_bns_exp);
1375
aa787c9b6955
A version of Fv that takes into account recursive and non-recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 300
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 301
val raw_bn_funs = map (Morphism.term morphism_2_1) raw_bn_funs_loc
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 302
val raw_bn_eqs = ProofContext.export lthy2 lthy raw_bn_eqs_loc
1295
0ecc775e5fce
Link calls to Raw permutations, FV definition and alpha_definition into the parser.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 303
val dtinfo = Datatype.the_info (ProofContext.theory_of lthy2) (hd raw_dt_names);
1309
+ − 304
val descr = #descr dtinfo;
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 305
val sorts = #sorts dtinfo;
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 306
val all_typs = map (fn i => typ_of_dtyp descr sorts (DtRec i)) (map fst descr)
1309
+ − 307
val all_full_tnames = map (fn (_, (n, _, _)) => n) descr;
+ − 308
val dtinfos = map (Datatype.the_info (ProofContext.theory_of lthy2)) all_full_tnames;
1342
+ − 309
val rel_dtinfos = List.take (dtinfos, (length dts));
1309
+ − 310
val inject = flat (map #inject dtinfos);
1428
+ − 311
val distincts = flat (map #distinct dtinfos);
1342
+ − 312
val rel_distinct = map #distinct rel_dtinfos;
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 313
val induct = #induct dtinfo;
1309
+ − 314
val inducts = #inducts dtinfo;
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 315
val _ = tracing "Defining permutations, fv and alpha";
1295
0ecc775e5fce
Link calls to Raw permutations, FV definition and alpha_definition into the parser.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 316
val ((raw_perm_def, raw_perm_simps, perms), lthy3) =
0ecc775e5fce
Link calls to Raw permutations, FV definition and alpha_definition into the parser.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 317
Local_Theory.theory_result (define_raw_perms dtinfo (length dts)) lthy2;
0ecc775e5fce
Link calls to Raw permutations, FV definition and alpha_definition into the parser.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 318
val raw_binds_flat = map (map flat) raw_binds;
1375
aa787c9b6955
A version of Fv that takes into account recursive and non-recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 319
val (((fv_ts_loc, fv_def_loc), alpha), lthy4) = define_fv_alpha dtinfo raw_binds_flat bn_funs_decls lthy3;
1326
+ − 320
val alpha_ts_loc = #preds alpha
1414
+ − 321
val alpha_ts_loc_nobn = List.take (alpha_ts_loc, length perms)
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 322
val morphism_4_3 = ProofContext.export_morphism lthy4 lthy3;
1340
+ − 323
val fv_ts = map (Morphism.term morphism_4_3) fv_ts_loc;
1448
+ − 324
val (fv_ts_loc_nobn, fv_ts_loc_bn) = chop (length perms) fv_ts_loc;
+ − 325
val (fv_ts_nobn, fv_ts_bn) = chop (length perms) fv_ts;
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 326
val alpha_ts = map (Morphism.term morphism_4_3) alpha_ts_loc;
1416
+ − 327
val (alpha_ts_nobn, alpha_ts_bn) = chop (length perms) alpha_ts
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 328
val alpha_induct_loc = #induct alpha
1340
+ − 329
val [alpha_induct] = ProofContext.export lthy4 lthy3 [alpha_induct_loc];
+ − 330
val alpha_inducts = Project_Rule.projects lthy4 (1 upto (length dts)) alpha_induct
+ − 331
val fv_def = ProofContext.export lthy4 lthy3 fv_def_loc;
1309
+ − 332
val dts_names = map (fn (i, (s, _, _)) => (s, i)) (#descr dtinfo);
+ − 333
val bn_tys = map (domain_type o fastype_of) raw_bn_funs;
+ − 334
val bn_nos = map (dtyp_no_of_typ dts_names) bn_tys;
+ − 335
val bns = raw_bn_funs ~~ bn_nos;
+ − 336
val alpha_intros = #intrs alpha;
1342
+ − 337
val alpha_cases_loc = #elims alpha
+ − 338
val alpha_cases = ProofContext.export lthy4 lthy3 alpha_cases_loc
1428
+ − 339
val alpha_inj_loc = build_alpha_inj alpha_intros (inject @ distincts) alpha_cases_loc lthy4
1340
+ − 340
val alpha_inj = ProofContext.export lthy4 lthy3 alpha_inj_loc
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 341
val _ = tracing "Proving equivariance";
1409
+ − 342
val (bv_eqvts, lthy5) = fold_map (build_bv_eqvt (raw_bn_eqs @ raw_perm_def) inducts) bns lthy4;
1411
+ − 343
val fv_eqvt_tac =
+ − 344
if !cheat_fv_eqvt then (fn _ => fn _ => Skip_Proof.cheat_tac thy)
+ − 345
else build_eqvts_tac induct ((flat (map snd bv_eqvts)) @ fv_def_loc @ raw_perm_def) lthy5
1448
+ − 346
val (fv_eqvts, lthy6) = build_eqvts Binding.empty fv_ts_loc_nobn fv_eqvt_tac lthy5;
1464
1850361efb8f
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 347
val (fv_bn_eqvts, lthy6a) =
1850361efb8f
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 348
if fv_ts_loc_bn = [] then ([], lthy6) else
1850361efb8f
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 349
fold_map (build_bv_eqvt ((flat (map snd bv_eqvts)) @ fv_def_loc @ raw_perm_def) inducts)
1850361efb8f
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 350
(fv_ts_loc_bn ~~ (map snd bns)) lthy6;
1448
+ − 351
val lthy6 = lthy6a;
1411
+ − 352
val raw_fv_bv_eqvt_loc = flat (map snd bv_eqvts) @ (snd fv_eqvts)
+ − 353
val raw_fv_bv_eqvt = ProofContext.export lthy6 lthy3 raw_fv_bv_eqvt_loc;
1454
7c8cd6eae8e2
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 354
fun alpha_eqvt_tac' _ =
7c8cd6eae8e2
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 355
if !cheat_alpha_eqvt then Skip_Proof.cheat_tac thy
7c8cd6eae8e2
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 356
else alpha_eqvt_tac alpha_induct_loc (raw_perm_def @ alpha_inj_loc @ raw_fv_bv_eqvt_loc) lthy6 1
7c8cd6eae8e2
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 357
val alpha_eqvt_loc = build_alpha_eqvts alpha_ts_loc alpha_eqvt_tac' lthy6;
7c8cd6eae8e2
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 358
val alpha_eqvt = ProofContext.export lthy6 lthy2 alpha_eqvt_loc;
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 359
val _ = tracing "Proving equivalence";
1443
+ − 360
val alpha_equivp_loc =
+ − 361
if !cheat_equivp then map (equivp_hack lthy6) alpha_ts_loc_nobn
+ − 362
else build_equivps alpha_ts_loc induct alpha_induct_loc
+ − 363
inject alpha_inj_loc distincts alpha_cases_loc alpha_eqvt_loc lthy6;
1412
+ − 364
val alpha_equivp = ProofContext.export lthy6 lthy2 alpha_equivp_loc;
+ − 365
val qty_binds = map (fn (_, b, _, _) => b) dts;
+ − 366
val qty_names = map Name.of_binding qty_binds;
+ − 367
val qty_full_names = map (Long_Name.qualify thy_name) qty_names
1316
0577afdb1732
Porting from Lift to Parser; until defining the Quotient type.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 368
val lthy7 = define_quotient_type
1414
+ − 369
(map (fn ((b, t), alpha) => (([], b, NoSyn), (t, alpha))) ((qty_binds ~~ all_typs) ~~ alpha_ts_nobn))
1339
5256f256edd8
Comment out Weird and Phd until we have an idea how to handle multiple permutations. Transp that works for multiple existentials.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 370
(ALLGOALS (resolve_tac alpha_equivp)) lthy6;
1340
+ − 371
val const_names = map Name.of_binding (flat (map (fn (_, _, _, t) => map (fn (b, _, _) => b) t) dts));
+ − 372
val raw_consts =
+ − 373
flat (map (fn (i, (_, _, l)) =>
+ − 374
map (fn (cname, dts) =>
+ − 375
Const (cname, map (typ_of_dtyp descr sorts) dts --->
+ − 376
typ_of_dtyp descr sorts (DtRec i))) l) descr);
+ − 377
val (consts_defs, lthy8) = fold_map Quotient_Def.quotient_lift_const (const_names ~~ raw_consts) lthy7;
1428
+ − 378
val (consts_loc, const_defs) = split_list consts_defs;
+ − 379
val morphism_8_7 = ProofContext.export_morphism lthy8 lthy7;
+ − 380
val consts = map (Morphism.term morphism_8_7) consts_loc;
+ − 381
(* Could be done nicer *)
+ − 382
val q_tys = distinct (op =) (map (snd o strip_type o fastype_of) consts);
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 383
val _ = tracing "Proving respects";
1340
+ − 384
val (bns_rsp_pre, lthy9) = fold_map (
+ − 385
fn (bn_t, i) => prove_const_rsp Binding.empty [bn_t]
+ − 386
(fn _ => fvbv_rsp_tac (nth alpha_inducts i) raw_bn_eqs 1)) bns lthy8;
+ − 387
val bns_rsp = flat (map snd bns_rsp_pre);
1416
+ − 388
fun fv_rsp_tac _ = if !cheat_fv_rsp then Skip_Proof.cheat_tac thy
+ − 389
else fvbv_rsp_tac alpha_induct fv_def 1;
+ − 390
val ((_, fv_rsp), lthy10) = prove_const_rsp Binding.empty fv_ts fv_rsp_tac lthy9
+ − 391
val (perms_rsp, lthy11) = prove_const_rsp Binding.empty perms
+ − 392
(fn _ => asm_simp_tac (HOL_ss addsimps alpha_eqvt) 1) lthy10;
+ − 393
fun const_rsp_tac _ = if !cheat_const_rsp then Skip_Proof.cheat_tac thy
+ − 394
else constr_rsp_tac alpha_inj (fv_rsp @ bns_rsp) alpha_equivp 1
+ − 395
val (const_rsps, lthy12) = fold_map (fn cnst => prove_const_rsp Binding.empty [cnst]
+ − 396
const_rsp_tac) (raw_consts @ alpha_ts_bn) lthy11
+ − 397
val qfv_names = map (unsuffix "_raw" o Long_Name.base_name o fst o dest_Const) fv_ts
1340
+ − 398
val (qfv_defs, lthy12a) = fold_map Quotient_Def.quotient_lift_const (qfv_names ~~ fv_ts) lthy12;
+ − 399
val qbn_names = map (fn (b, _ , _) => Name.of_binding b) bn_funs
+ − 400
val (qbn_defs, lthy12b) = fold_map Quotient_Def.quotient_lift_const (qbn_names ~~ raw_bn_funs) lthy12a;
1417
+ − 401
val qalpha_bn_names = map (unsuffix "_raw" o Long_Name.base_name o fst o dest_Const) alpha_ts_bn
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 402
val _ = tracing "Lifting permutations";
1417
+ − 403
val (qbn_defs, lthy12c) = fold_map Quotient_Def.quotient_lift_const (qalpha_bn_names ~~ alpha_ts_bn) lthy12b;
+ − 404
val thy = Local_Theory.exit_global lthy12c;
1340
+ − 405
val perm_names = map (fn x => "permute_" ^ x) qty_names
+ − 406
val thy' = define_lifted_perms qty_full_names (perm_names ~~ perms) raw_perm_simps thy;
+ − 407
val lthy13 = Theory_Target.init NONE thy';
+ − 408
val q_name = space_implode "_" qty_names;
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 409
val _ = tracing "Lifting induction";
1422
+ − 410
val q_induct = lift_thm lthy13 induct;
1340
+ − 411
val (_, lthy14) = Local_Theory.note ((Binding.name (q_name ^ "_induct"), []), [q_induct]) lthy13;
1447
378b8c791de8
derive "inducts" from "induct" instead of lifting again is much faster.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 412
val q_inducts = Project_Rule.projects lthy13 (1 upto (length alpha_inducts)) q_induct
378b8c791de8
derive "inducts" from "induct" instead of lifting again is much faster.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 413
val (_, lthy14a) = Local_Theory.note ((Binding.name (q_name ^ "_inducts"), []), q_inducts) lthy14;
1422
+ − 414
val q_perm = map (lift_thm lthy14) raw_perm_def;
1447
378b8c791de8
derive "inducts" from "induct" instead of lifting again is much faster.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 415
val (_, lthy15) = Local_Theory.note ((Binding.name (q_name ^ "_perm"), []), q_perm) lthy14a;
1422
+ − 416
val q_fv = map (lift_thm lthy15) fv_def;
1340
+ − 417
val (_, lthy16) = Local_Theory.note ((Binding.name (q_name ^ "_fv"), []), q_fv) lthy15;
1422
+ − 418
val q_bn = map (lift_thm lthy16) raw_bn_eqs;
1340
+ − 419
val (_, lthy17) = Local_Theory.note ((Binding.name (q_name ^ "_bn"), []), q_bn) lthy16;
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 420
val _ = tracing "Lifting pseudo-injectivity";
1467
+ − 421
val inj_unfolded1 = map (Local_Defs.unfold lthy17 @{thms alpha_gen2}) alpha_inj
+ − 422
val inj_unfolded2 = map (Local_Defs.unfold lthy17 @{thms alpha_gen}) inj_unfolded1
+ − 423
val q_inj_pre1 = map (lift_thm lthy17) inj_unfolded2;
+ − 424
val q_inj_pre2 = map (Local_Defs.fold lthy17 @{thms alpha_gen2}) q_inj_pre1
+ − 425
val q_inj = map (Local_Defs.fold lthy17 @{thms alpha_gen}) q_inj_pre2
1342
+ − 426
val (_, lthy18) = Local_Theory.note ((Binding.name (q_name ^ "_inject"), []), q_inj) lthy17;
+ − 427
val rel_dists = flat (map (distinct_rel lthy18 alpha_cases)
+ − 428
(rel_distinct ~~ (List.take (alpha_ts, (length dts)))))
1422
+ − 429
val q_dis = map (lift_thm lthy18) rel_dists;
1346
+ − 430
val (_, lthy19) = Local_Theory.note ((Binding.name (q_name ^ "_distinct"), []), q_dis) lthy18;
1422
+ − 431
val q_eqvt = map (lift_thm lthy19) raw_fv_bv_eqvt;
1346
+ − 432
val (_, lthy20) = Local_Theory.note ((Binding.empty,
+ − 433
[Attrib.internal (fn _ => Nominal_ThmDecls.eqvt_add)]), q_eqvt) lthy19;
1480
21cbb5b0e321
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 434
val _ = tracing "Finite Support";
1428
+ − 435
val supports = map (prove_supports lthy20 q_perm) consts
1433
+ − 436
val fin_supp = HOLogic.conj_elims (prove_fs lthy20 q_induct supports q_tys) handle _ => []
1428
+ − 437
val thy3 = Local_Theory.exit_global lthy20;
+ − 438
val lthy21 = Theory_Target.instantiation (qty_full_names, [], @{sort fs}) thy3;
+ − 439
fun tac _ = Class.intro_classes_tac [] THEN (ALLGOALS (resolve_tac fin_supp))
1433
+ − 440
val lthy22 = Class.prove_instantiation_instance tac lthy21 handle _ => lthy20
1293
+ − 441
in
1428
+ − 442
((raw_dt_names, raw_bn_funs, raw_bn_eqs, raw_binds), lthy22)
1346
+ − 443
end
978
b44592adf235
Improper interface for datatype and function packages and proper interface lateron.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 444
*}
1340
+ − 445
1422
+ − 446
1284
+ − 447
ML {*
+ − 448
(* parsing the datatypes and declaring *)
+ − 449
(* constructors in the local theory *)
+ − 450
fun prepare_dts dt_strs lthy =
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 451
let
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 452
val thy = ProofContext.theory_of lthy
1284
+ − 453
+ − 454
fun mk_type full_tname tvrs =
+ − 455
Type (full_tname, map (fn a => TVar ((a, 0), [])) tvrs)
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 456
1284
+ − 457
fun prep_cnstr lthy full_tname tvs (cname, anno_tys, mx, _) =
+ − 458
let
+ − 459
val tys = map (Syntax.read_typ lthy o snd) anno_tys
+ − 460
val ty = mk_type full_tname tvs
+ − 461
in
+ − 462
((cname, tys ---> ty, mx), (cname, tys, mx))
+ − 463
end
+ − 464
+ − 465
fun prep_dt lthy (tvs, tname, mx, cnstrs) =
+ − 466
let
+ − 467
val full_tname = Sign.full_name thy tname
+ − 468
val (cnstrs', cnstrs'') =
+ − 469
split_list (map (prep_cnstr lthy full_tname tvs) cnstrs)
+ − 470
in
+ − 471
(cnstrs', (tvs, tname, mx, cnstrs''))
+ − 472
end
1266
+ − 473
1284
+ − 474
val (cnstrs, dts) =
+ − 475
split_list (map (prep_dt lthy) dt_strs)
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 476
in
1284
+ − 477
lthy
+ − 478
|> Local_Theory.theory (Sign.add_consts_i (flat cnstrs))
+ − 479
|> pair dts
1251
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 480
end
11b8798dea5d
parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 481
*}
1232
35bc8f7b66f8
parsing of function definitions almost works now; still an error with undefined constants
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 482
1284
+ − 483
ML {*
1285
+ − 484
(* parsing the binding function specification and *)
+ − 485
(* declaring the functions in the local theory *)
1284
+ − 486
fun prepare_bn_funs bn_fun_strs bn_eq_strs lthy =
+ − 487
let
+ − 488
val ((bn_funs, bn_eqs), _) =
+ − 489
Specification.read_spec bn_fun_strs bn_eq_strs lthy
+ − 490
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 491
fun prep_bn_fun ((bn, T), mx) = (bn, T, mx)
1284
+ − 492
val bn_funs' = map prep_bn_fun bn_funs
+ − 493
in
+ − 494
lthy
+ − 495
|> Local_Theory.theory (Sign.add_consts_i bn_funs')
+ − 496
|> pair (bn_funs', bn_eqs)
+ − 497
end
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 498
*}
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 499
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 500
ML {*
1290
+ − 501
fun find_all eq xs (k',i) =
+ − 502
maps (fn (k, (v1, v2)) => if eq (k, k') then [(v1, v2, i)] else []) xs
1285
+ − 503
*}
1284
+ − 504
1285
+ − 505
ML {*
1290
+ − 506
(* associates every SOME with the index in the list; drops NONEs *)
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 507
fun mk_env xs =
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 508
let
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 509
fun mapp (_: int) [] = []
1285
+ − 510
| mapp i (a :: xs) =
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 511
case a of
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 512
NONE => mapp (i + 1) xs
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 513
| SOME x => (x, i) :: mapp (i + 1) xs
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 514
in mapp 0 xs end
1285
+ − 515
*}
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 516
1285
+ − 517
ML {*
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 518
fun env_lookup xs x =
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 519
case AList.lookup (op =) xs x of
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 520
SOME x => x
1287
+ − 521
| NONE => error ("cannot find " ^ x ^ " in the binding specification.");
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 522
*}
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 523
978
b44592adf235
Improper interface for datatype and function packages and proper interface lateron.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 524
ML {*
1436
+ − 525
val recursive = ref false
+ − 526
*}
+ − 527
+ − 528
ML {*
1284
+ − 529
fun prepare_binds dt_strs lthy =
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 530
let
1287
+ − 531
fun extract_annos_binds dt_strs =
1290
+ − 532
map (map (fn (_, antys, _, bns) => (map fst antys, bns))) dt_strs
1285
+ − 533
+ − 534
fun prep_bn env bn_str =
+ − 535
case (Syntax.read_term lthy bn_str) of
1290
+ − 536
Free (x, _) => (NONE, env_lookup env x)
1436
+ − 537
| Const (a, T) $ Free (x, _) => (SOME (Const (a, T), !recursive), env_lookup env x)
1285
+ − 538
| _ => error (bn_str ^ " not allowed as binding specification.");
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 539
1290
+ − 540
fun prep_typ env (i, opt_name) =
1285
+ − 541
case opt_name of
+ − 542
NONE => []
1290
+ − 543
| SOME x => find_all (op=) env (x,i);
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 544
1287
+ − 545
(* annos - list of annotation for each type (either NONE or SOME fo a type *)
+ − 546
+ − 547
fun prep_binds (annos, bind_strs) =
1284
+ − 548
let
1290
+ − 549
val env = mk_env annos (* for every label the index *)
1284
+ − 550
val binds = map (fn (x, y) => (x, prep_bn env y)) bind_strs
+ − 551
in
1290
+ − 552
map_index (prep_typ binds) annos
1284
+ − 553
end
1287
+ − 554
969
cc5d18c78446
Parsing of the input as terms and types, and passing them as such to the function package.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 555
in
1290
+ − 556
map (map prep_binds) (extract_annos_binds (get_cnstrs dt_strs))
969
cc5d18c78446
Parsing of the input as terms and types, and passing them as such to the function package.
Cezary Kaliszyk <kaliszyk@in.tum.de>
diff
changeset
+ − 557
end
966
+ − 558
*}
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 559
1284
+ − 560
ML {*
+ − 561
fun nominal_datatype2_cmd (dt_strs, bn_fun_strs, bn_eq_strs) lthy =
+ − 562
let
+ − 563
fun prep_typ (tvs, tname, mx, _) = (tname, length tvs, mx)
+ − 564
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 565
val lthy0 =
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 566
Local_Theory.theory (Sign.add_types (map prep_typ dt_strs)) lthy
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 567
val (dts, lthy1) =
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 568
prepare_dts dt_strs lthy0
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 569
val ((bn_funs, bn_eqs), lthy2) =
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 570
prepare_bn_funs bn_fun_strs bn_eq_strs lthy1
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 571
val binds = prepare_binds dt_strs lthy2
1284
+ − 572
in
1380
dab8d99b37c1
added bn-information, but it is not yet ordered according to the dts
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 573
nominal_datatype2 dts bn_funs bn_eqs binds lthy |> snd
1284
+ − 574
end
+ − 575
*}
+ − 576
+ − 577
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 578
(* Command Keyword *)
1283
6a133abb7633
generated the "binding list" from the input; at the moment it is only printed out as tracing; does not yet include the "bind itself binders"
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 579
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 580
ML {*
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 581
let
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 582
val kind = OuterKeyword.thy_decl
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 583
in
1228
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 584
OuterSyntax.local_theory "nominal_datatype" "test" kind
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 585
(main_parser >> nominal_datatype2_cmd)
954
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 586
end
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 587
*}
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 588
c009d2535896
very rough example file for how nominal2 specification can be parsed
Christian Urban <urbanc@in.tum.de>
parents:
diff
changeset
+ − 589
961
+ − 590
end
1223
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 591
160343d86a6f
"raw"-ified the term-constructors and types given in the specification
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 592
1228
c179ad9d2446
declarartion of the raw datatype already works; raw binding functions throw an exception about mutual recursive types
Christian Urban <urbanc@in.tum.de>
diff
changeset
+ − 593