src/Pure/term.ML
author wenzelm
Wed, 29 Jun 2005 15:13:29 +0200
changeset 16599 34f99c3221bb
parent 16589 24c32abc8b84
child 16667 f56080acd176
permissions -rw-r--r--
tuned sort_ord: pointer_eq; tuned size_of_term: less stack usage;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
     1
(*  Title:      Pure/term.ML
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   Cambridge University 1992
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
     5
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
     6
Simply typed lambda-calculus: types, terms, and basic operations.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
     9
infix 9  $;
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
    10
infixr 5 -->;
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    11
infixr --->;
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    12
infix aconv;
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
    13
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    14
signature BASIC_TERM =
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    15
sig
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    16
  type indexname
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    17
  type class
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    18
  type sort
14829
cfa5fe01a7b7 moved read_int etc. to library.ML; added type 'arity';
wenzelm
parents: 14786
diff changeset
    19
  type arity
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    20
  datatype typ =
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    21
    Type  of string * typ list |
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    22
    TFree of string * sort |
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    23
    TVar  of indexname * sort
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    24
  datatype term =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    25
    Const of string * typ |
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    26
    Free of string * typ |
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    27
    Var of indexname * typ |
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    28
    Bound of int |
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    29
    Abs of string * typ * term |
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    30
    op $ of term * term
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    31
  exception TYPE of string * typ list * term list
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    32
  exception TERM of string * term list
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    33
  val --> : typ * typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    34
  val ---> : typ list * typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    35
  val is_TVar: typ -> bool
15573
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
    36
  val is_funtype: typ -> bool
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    37
  val domain_type: typ -> typ
4480
d26e28c52788 export range_type;
wenzelm
parents: 4464
diff changeset
    38
  val range_type: typ -> typ
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    39
  val binder_types: typ -> typ list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    40
  val body_type: typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    41
  val strip_type: typ -> typ list * typ
7318
768fab6dae74 Corrected two busg in the simplifier.
nipkow
parents: 6963
diff changeset
    42
  val is_Bound: term -> bool
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    43
  val is_Const: term -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    44
  val is_Free: term -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    45
  val is_Var: term -> bool
16589
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
    46
  val is_first_order: string list -> term -> bool
6033
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
    47
  val dest_Type: typ -> string * typ list
15914
2a8f86685745 lucas - added dest_TVar and dest_TFree.
dixon
parents: 15797
diff changeset
    48
  val dest_TVar: typ -> indexname * sort
2a8f86685745 lucas - added dest_TVar and dest_TFree.
dixon
parents: 15797
diff changeset
    49
  val dest_TFree: typ -> string * sort
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    50
  val dest_Const: term -> string * typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    51
  val dest_Free: term -> string * typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    52
  val dest_Var: term -> indexname * typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    53
  val type_of: term -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    54
  val type_of1: typ list * term -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    55
  val fastype_of: term -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    56
  val fastype_of1: typ list * term -> typ
10806
2eba1c06592c added list_abs;
wenzelm
parents: 10666
diff changeset
    57
  val list_abs: (string * typ) list * term -> term
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    58
  val strip_abs_body: term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    59
  val strip_abs_vars: term -> (string * typ) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    60
  val strip_qnt_body: string -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    61
  val strip_qnt_vars: string -> term -> (string * typ) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    62
  val list_comb: term * term list -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    63
  val strip_comb: term -> term * term list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    64
  val head_of: term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    65
  val size_of_term: term -> int
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    66
  val map_type_tvar: (indexname * sort -> typ) -> typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    67
  val map_type_tfree: (string * sort -> typ) -> typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    68
  val map_term_types: (typ -> typ) -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    69
  val it_term_types: (typ * 'a -> 'a) -> term * 'a -> 'a
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    70
  structure Vartab: TABLE
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    71
  structure Typtab: TABLE
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    72
  structure Termtab: TABLE
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    73
  val aconv: term * term -> bool
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
    74
  val aconvs: term list * term list -> bool
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    75
  val foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a
8609
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
    76
  val foldl_term_types: (term -> 'a * typ -> 'a) -> 'a * term -> 'a
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    77
  val foldl_types: ('a * typ -> 'a) -> 'a * term -> 'a
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    78
  val foldl_aterms: ('a * term -> 'a) -> 'a * term -> 'a
6548
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
    79
  val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term
15025
b2ef0bc6f59f added add_term_varnames, term_varnames;
wenzelm
parents: 14854
diff changeset
    80
  val add_term_varnames: indexname list * term -> indexname list
b2ef0bc6f59f added add_term_varnames, term_varnames;
wenzelm
parents: 14854
diff changeset
    81
  val term_varnames: term -> indexname list
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    82
  val dummyT: typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    83
  val itselfT: typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    84
  val a_itselfT: typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    85
  val propT: typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    86
  val implies: term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    87
  val all: typ -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    88
  val equals: typ -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    89
  val strip_all_body: term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    90
  val strip_all_vars: term -> (string * typ) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    91
  val incr_bv: int * int * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    92
  val incr_boundvars: int -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    93
  val add_loose_bnos: term * int * int list -> int list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    94
  val loose_bnos: term -> int list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    95
  val loose_bvar: term * int -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    96
  val loose_bvar1: term * int -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    97
  val subst_bounds: term list * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    98
  val subst_bound: term * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
    99
  val subst_TVars: (indexname * typ) list -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   100
  val betapply: term * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   101
  val eq_ix: indexname * indexname -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   102
  val ins_ix: indexname * indexname list -> indexname list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   103
  val mem_ix: indexname * indexname list -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   104
  val mem_term: term * term list -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   105
  val subset_term: term list * term list -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   106
  val eq_set_term: term list * term list -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   107
  val ins_term: term * term list -> term list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   108
  val union_term: term list * term list -> term list
5585
8fcb0f181ad6 new function inter_term
paulson
parents: 4694
diff changeset
   109
  val inter_term: term list * term list -> term list
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   110
  val could_unify: term * term -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   111
  val subst_free: (term * term) list -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   112
  val subst_atomic: (term * term) list -> term -> term
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   113
  val typ_subst_atomic: (typ * typ) list -> typ -> typ
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   114
  val subst_vars: (indexname * typ) list * (indexname * term) list -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   115
  val typ_subst_TVars: (indexname * typ) list -> typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   116
  val subst_Vars: (indexname * term) list -> term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   117
  val incr_tvar: int -> typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   118
  val xless: (string * int) * indexname -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   119
  val atless: term * term -> bool
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   120
  val insert_aterm: term * term list -> term list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   121
  val abstract_over: term * term -> term
11922
78857e6107cb added lambda;
wenzelm
parents: 11903
diff changeset
   122
  val lambda: term -> term -> term
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   123
  val absfree: string * typ * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   124
  val list_abs_free: (string * typ) list * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   125
  val list_all_free: (string * typ) list * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   126
  val list_all: (string * typ) list * term -> term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   127
  val maxidx_of_typ: typ -> int
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   128
  val maxidx_of_typs: typ list -> int
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   129
  val maxidx_of_term: term -> int
13665
66e151df01c8 - removed flexpair
berghofe
parents: 13646
diff changeset
   130
  val maxidx_of_terms: term list -> int
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   131
  val variant: string list -> string -> string
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   132
  val variantlist: string list * string list -> string list
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   133
    (*note reversed order of args wrt. variant!*)
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   134
  val variant_abs: string * typ * term -> string * term
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   135
  val rename_wrt_term: term -> (string * typ) list -> (string * typ) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   136
  val add_new_id: string list * string -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   137
  val add_typ_classes: typ * class list -> class list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   138
  val add_typ_ixns: indexname list * typ -> indexname list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   139
  val add_typ_tfree_names: typ * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   140
  val add_typ_tfrees: typ * (string * sort) list -> (string * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   141
  val typ_tfrees: typ -> (string * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   142
  val add_typ_tvars: typ * (indexname * sort) list -> (indexname * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   143
  val typ_tvars: typ -> (indexname * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   144
  val add_typ_tycons: typ * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   145
  val add_typ_varnames: typ * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   146
  val add_term_classes: term * class list -> class list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   147
  val add_term_consts: term * string list -> string list
13646
46ed3d042ba5 Ported find_intro/elim to Isar.
nipkow
parents: 13484
diff changeset
   148
  val term_consts: term -> string list
16108
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   149
  val term_constsT: term -> (string * typ) list
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   150
  val add_term_frees: term * term list -> term list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   151
  val term_frees: term -> term list
12802
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   152
  val add_term_free_names: term * string list -> string list
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   153
  val add_term_names: term * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   154
  val add_term_tfree_names: term * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   155
  val add_term_tfrees: term * (string * sort) list -> (string * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   156
  val term_tfrees: term -> (string * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   157
  val add_term_tvar_ixns: term * indexname list -> indexname list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   158
  val add_term_tvarnames: term * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   159
  val add_term_tvars: term * (indexname * sort) list -> (indexname * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   160
  val term_tvars: term -> (indexname * sort) list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   161
  val add_term_tycons: term * string list -> string list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   162
  val add_term_vars: term * term list -> term list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   163
  val term_vars: term -> term list
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   164
  val exists_Const: (string * typ -> bool) -> term -> bool
4631
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   165
  val exists_subterm: (term -> bool) -> term -> bool
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   166
  val compress_type: typ -> typ
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   167
  val compress_term: term -> term
15986
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
   168
  val show_question_marks: bool ref
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   169
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   170
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   171
signature TERM =
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   172
sig
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   173
  include BASIC_TERM
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   174
  val indexname_ord: indexname * indexname -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   175
  val sort_ord: sort * sort -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   176
  val typ_ord: typ * typ -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   177
  val typs_ord: typ list * typ list -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   178
  val term_ord: term * term -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   179
  val terms_ord: term list * term list -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   180
  val hd_ord: term * term -> order
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   181
  val termless: term * term -> bool
16570
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   182
  val term_lpo: (string -> int) -> term * term -> order
12981
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   183
  val match_bvars: (term * term) * (string * string) list -> (string * string) list
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   184
  val rename_abs: term -> term -> term -> term option
12499
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
   185
  val invent_names: string list -> string -> int -> string list
16338
3d1851acb4d0 map_typ and map_term no longer global;
wenzelm
parents: 16294
diff changeset
   186
  val map_typ: (string -> string) -> (string -> string) -> typ -> typ
3d1851acb4d0 map_typ and map_term no longer global;
wenzelm
parents: 16294
diff changeset
   187
  val map_term: (string -> string) -> (string -> string) -> (string -> string) -> term -> term
12499
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
   188
  val add_tvarsT: (indexname * sort) list * typ -> (indexname * sort) list
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
   189
  val add_tvars: (indexname * sort) list * term -> (indexname * sort) list
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
   190
  val add_vars: (indexname * typ) list * term -> (indexname * typ) list
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
   191
  val add_frees: (string * typ) list * term -> (string * typ) list
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
   192
  val no_dummyT: typ -> typ
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   193
  val dummy_patternN: string
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   194
  val no_dummy_patterns: term -> term
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   195
  val replace_dummy_patterns: int * term -> int * term
10552
a177b8571026 added is_replaced_dummy_pattern;
wenzelm
parents: 9721
diff changeset
   196
  val is_replaced_dummy_pattern: indexname -> bool
16035
31bd65f7b22a added show_dummy_patterns;
wenzelm
parents: 15986
diff changeset
   197
  val show_dummy_patterns: term -> term
13484
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
   198
  val adhoc_freeze_vars: term -> term * string list
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
   199
  val string_of_vname: indexname -> string
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
   200
  val string_of_vname': indexname -> string
15612
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
   201
  val string_of_term: term -> string
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   202
end;
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   203
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
   204
structure Term: TERM =
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
   205
struct
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   206
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   207
(*Indexnames can be quickly renamed by adding an offset to the integer part,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   208
  for resolution.*)
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   209
type indexname = string * int;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   210
4626
51dd12f34c78 tuned comments;
wenzelm
parents: 4604
diff changeset
   211
(* Types are classified by sorts. *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   212
type class = string;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   213
type sort  = class list;
14829
cfa5fe01a7b7 moved read_int etc. to library.ML; added type 'arity';
wenzelm
parents: 14786
diff changeset
   214
type arity = string * sort list * sort;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   215
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   216
(* The sorts attached to TFrees and TVars specify the sort of that variable *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   217
datatype typ = Type  of string * typ list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   218
             | TFree of string * sort
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   219
             | TVar  of indexname * sort;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   220
6033
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   221
(*Terms.  Bound variables are indicated by depth number.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   222
  Free variables, (scheme) variables and constants have names.
4626
51dd12f34c78 tuned comments;
wenzelm
parents: 4604
diff changeset
   223
  An term is "closed" if every bound variable of level "lev"
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   224
  is enclosed by at least "lev" abstractions.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   225
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   226
  It is possible to create meaningless terms containing loose bound vars
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   227
  or type mismatches.  But such terms are not allowed in rules. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   228
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   229
datatype term =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   230
    Const of string * typ
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   231
  | Free  of string * typ
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   232
  | Var   of indexname * typ
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   233
  | Bound of int
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   234
  | Abs   of string*typ*term
3965
1d7b53e6a2cb made Poly/ML happy, but SML/NJ unhappy;
wenzelm
parents: 3958
diff changeset
   235
  | op $  of term*term;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   236
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   237
(*Errors involving type mismatches*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   238
exception TYPE of string * typ list * term list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   239
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   240
(*Errors errors involving terms*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   241
exception TERM of string * term list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   242
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   243
(*Note variable naming conventions!
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   244
    a,b,c: string
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   245
    f,g,h: functions (including terms of function type)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   246
    i,j,m,n: int
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   247
    t,u: term
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   248
    v,w: indexnames
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   249
    x,y: any
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   250
    A,B,C: term (denoting formulae)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   251
    T,U: typ
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   252
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   253
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   254
6033
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   255
(** Types **)
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   256
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   257
(*dummy type for parsing and printing etc.*)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   258
val dummyT = Type ("dummy", []);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   259
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   260
fun no_dummyT typ =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   261
  let
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   262
    fun check (T as Type ("dummy", _)) =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   263
          raise TYPE ("Illegal occurrence of '_' dummy type", [T], [])
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   264
      | check (Type (_, Ts)) = List.app check Ts
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   265
      | check _ = ();
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   266
  in check typ; typ end;
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   267
6033
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   268
fun S --> T = Type("fun",[S,T]);
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   269
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   270
(*handy for multiple args: [T1,...,Tn]--->T  gives  T1-->(T2--> ... -->T)*)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   271
val op ---> = Library.foldr (op -->);
6033
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   272
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   273
fun dest_Type (Type x) = x
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   274
  | dest_Type T = raise TYPE ("dest_Type", [T], []);
15914
2a8f86685745 lucas - added dest_TVar and dest_TFree.
dixon
parents: 15797
diff changeset
   275
fun dest_TVar (TVar x) = x
2a8f86685745 lucas - added dest_TVar and dest_TFree.
dixon
parents: 15797
diff changeset
   276
  | dest_TVar T = raise TYPE ("dest_TVar", [T], []);
2a8f86685745 lucas - added dest_TVar and dest_TFree.
dixon
parents: 15797
diff changeset
   277
fun dest_TFree (TFree x) = x
2a8f86685745 lucas - added dest_TVar and dest_TFree.
dixon
parents: 15797
diff changeset
   278
  | dest_TFree T = raise TYPE ("dest_TFree", [T], []);
6033
c8c69a4a7762 moved dest_Type to term.ML from HOL/Tools/primrec_package
paulson
parents: 5986
diff changeset
   279
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   280
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   281
(** Discriminators **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   282
7318
768fab6dae74 Corrected two busg in the simplifier.
nipkow
parents: 6963
diff changeset
   283
fun is_Bound (Bound _) = true
768fab6dae74 Corrected two busg in the simplifier.
nipkow
parents: 6963
diff changeset
   284
  | is_Bound _         = false;
768fab6dae74 Corrected two busg in the simplifier.
nipkow
parents: 6963
diff changeset
   285
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   286
fun is_Const (Const _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   287
  | is_Const _ = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   288
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   289
fun is_Free (Free _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   290
  | is_Free _ = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   291
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   292
fun is_Var (Var _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   293
  | is_Var _ = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   294
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   295
fun is_TVar (TVar _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   296
  | is_TVar _ = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   297
15573
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   298
(*Differs from proofterm/is_fun in its treatment of TVar*)
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   299
fun is_funtype (Type("fun",[_,_])) = true
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   300
  | is_funtype _ = false;
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   301
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   302
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   303
(** Destructors **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   304
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   305
fun dest_Const (Const x) =  x
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   306
  | dest_Const t = raise TERM("dest_Const", [t]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   307
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   308
fun dest_Free (Free x) =  x
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   309
  | dest_Free t = raise TERM("dest_Free", [t]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   310
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   311
fun dest_Var (Var x) =  x
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   312
  | dest_Var t = raise TERM("dest_Var", [t]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   313
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   314
4464
7a8150506746 Added range-type for completeness
paulson
parents: 4444
diff changeset
   315
fun domain_type (Type("fun", [T,_])) = T
7a8150506746 Added range-type for completeness
paulson
parents: 4444
diff changeset
   316
and range_type  (Type("fun", [_,T])) = T;
4064
9c18a0c9b6f8 New syntax function for types
paulson
parents: 4017
diff changeset
   317
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   318
(* maps  [T1,...,Tn]--->T  to the list  [T1,T2,...,Tn]*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   319
fun binder_types (Type("fun",[S,T])) = S :: binder_types T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   320
  | binder_types _   =  [];
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   321
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   322
(* maps  [T1,...,Tn]--->T  to T*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   323
fun body_type (Type("fun",[S,T])) = body_type T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   324
  | body_type T   =  T;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   325
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   326
(* maps  [T1,...,Tn]--->T  to   ([T1,T2,...,Tn], T)  *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   327
fun strip_type T : typ list * typ =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   328
  (binder_types T, body_type T);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   329
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   330
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   331
(*Compute the type of the term, checking that combinations are well-typed
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   332
  Ts = [T0,T1,...] holds types of bound variables 0, 1, ...*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   333
fun type_of1 (Ts, Const (_,T)) = T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   334
  | type_of1 (Ts, Free  (_,T)) = T
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   335
  | type_of1 (Ts, Bound i) = (List.nth (Ts,i)
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   336
        handle Subscript => raise TYPE("type_of: bound variable", [], [Bound i]))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   337
  | type_of1 (Ts, Var (_,T)) = T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   338
  | type_of1 (Ts, Abs (_,T,body)) = T --> type_of1(T::Ts, body)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   339
  | type_of1 (Ts, f$u) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   340
      let val U = type_of1(Ts,u)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   341
          and T = type_of1(Ts,f)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   342
      in case T of
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   343
            Type("fun",[T1,T2]) =>
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   344
              if T1=U then T2  else raise TYPE
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   345
                    ("type_of: type mismatch in application", [T1,U], [f$u])
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   346
          | _ => raise TYPE
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   347
                    ("type_of: function type is expected in application",
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   348
                     [T,U], [f$u])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   349
      end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   350
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   351
fun type_of t : typ = type_of1 ([],t);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   352
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   353
(*Determines the type of a term, with minimal checking*)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   354
fun fastype_of1 (Ts, f$u) =
61
f8c1922b78e3 Pure/term/fastype_of1: renamed from fastype_of
lcp
parents: 40
diff changeset
   355
    (case fastype_of1 (Ts,f) of
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   356
        Type("fun",[_,T]) => T
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   357
        | _ => raise TERM("fastype_of: expected function type", [f$u]))
61
f8c1922b78e3 Pure/term/fastype_of1: renamed from fastype_of
lcp
parents: 40
diff changeset
   358
  | fastype_of1 (_, Const (_,T)) = T
f8c1922b78e3 Pure/term/fastype_of1: renamed from fastype_of
lcp
parents: 40
diff changeset
   359
  | fastype_of1 (_, Free (_,T)) = T
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   360
  | fastype_of1 (Ts, Bound i) = (List.nth(Ts,i)
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   361
         handle Subscript => raise TERM("fastype_of: Bound", [Bound i]))
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   362
  | fastype_of1 (_, Var (_,T)) = T
61
f8c1922b78e3 Pure/term/fastype_of1: renamed from fastype_of
lcp
parents: 40
diff changeset
   363
  | fastype_of1 (Ts, Abs (_,T,u)) = T --> fastype_of1 (T::Ts, u);
f8c1922b78e3 Pure/term/fastype_of1: renamed from fastype_of
lcp
parents: 40
diff changeset
   364
f8c1922b78e3 Pure/term/fastype_of1: renamed from fastype_of
lcp
parents: 40
diff changeset
   365
fun fastype_of t : typ = fastype_of1 ([],t);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   366
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   367
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   368
val list_abs = Library.foldr (fn ((x, T), t) => Abs (x, T, t));
10806
2eba1c06592c added list_abs;
wenzelm
parents: 10666
diff changeset
   369
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   370
(* maps  (x1,...,xn)t   to   t  *)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   371
fun strip_abs_body (Abs(_,_,t))  =  strip_abs_body t
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   372
  | strip_abs_body u  =  u;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   373
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   374
(* maps  (x1,...,xn)t   to   [x1, ..., xn]  *)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   375
fun strip_abs_vars (Abs(a,T,t))  =  (a,T) :: strip_abs_vars t
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   376
  | strip_abs_vars u  =  [] : (string*typ) list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   377
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   378
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   379
fun strip_qnt_body qnt =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   380
let fun strip(tm as Const(c,_)$Abs(_,_,t)) = if c=qnt then strip t else tm
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   381
      | strip t = t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   382
in strip end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   383
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   384
fun strip_qnt_vars qnt =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   385
let fun strip(Const(c,_)$Abs(a,T,t)) = if c=qnt then (a,T)::strip t else []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   386
      | strip t  =  [] : (string*typ) list
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   387
in strip end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   388
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   389
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   390
(* maps   (f, [t1,...,tn])  to  f(t1,...,tn) *)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   391
val list_comb : term * term list -> term = Library.foldl (op $);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   392
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   393
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   394
(* maps   f(t1,...,tn)  to  (f, [t1,...,tn]) ; naturally tail-recursive*)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   395
fun strip_comb u : term * term list =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   396
    let fun stripc (f$t, ts) = stripc (f, t::ts)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   397
        |   stripc  x =  x
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   398
    in  stripc(u,[])  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   399
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   400
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   401
(* maps   f(t1,...,tn)  to  f , which is never a combination *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   402
fun head_of (f$t) = head_of f
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   403
  | head_of u = u;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   404
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   405
16599
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   406
(*number of atoms and abstractions in a term*)
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   407
fun size_of_term tm =
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   408
  let
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   409
    fun add_size (t $ u) n = add_size t (add_size u n)
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   410
      | add_size (Abs (_ ,_, t)) n = add_size t (n + 1)
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   411
      | add_size _ n = n + 1;
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   412
  in add_size tm 0 end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   413
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   414
fun map_type_tvar f (Type(a,Ts)) = Type(a, map (map_type_tvar f) Ts)
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   415
  | map_type_tvar f (T as TFree _) = T
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   416
  | map_type_tvar f (TVar x) = f x;
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   417
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   418
fun map_type_tfree f (Type(a,Ts)) = Type(a, map (map_type_tfree f) Ts)
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   419
  | map_type_tfree f (TFree x) = f x
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   420
  | map_type_tfree f (T as TVar _) = T;
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   421
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   422
(* apply a function to all types in a term *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   423
fun map_term_types f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   424
let fun map(Const(a,T)) = Const(a, f T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   425
      | map(Free(a,T)) = Free(a, f T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   426
      | map(Var(v,T)) = Var(v, f T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   427
      | map(t as Bound _)  = t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   428
      | map(Abs(a,T,t)) = Abs(a, f T, map t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   429
      | map(f$t) = map f $ map t;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   430
in map end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   431
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   432
(* iterate a function over all types in a term *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   433
fun it_term_types f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   434
let fun iter(Const(_,T), a) = f(T,a)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   435
      | iter(Free(_,T), a) = f(T,a)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   436
      | iter(Var(_,T), a) = f(T,a)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   437
      | iter(Abs(_,T,t), a) = iter(t,f(T,a))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   438
      | iter(f$u, a) = iter(f, iter(u, a))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   439
      | iter(Bound _, a) = a
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   440
in iter end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   441
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   442
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   443
(** Comparing terms, types etc. **)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   444
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   445
fun indexname_ord ((x, i), (y, j)) =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   446
  (case int_ord (i, j) of EQUAL => string_ord (x, y) | ord => ord);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   447
16599
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   448
fun sort_ord SS =
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   449
  if pointer_eq SS then EQUAL
34f99c3221bb tuned sort_ord: pointer_eq;
wenzelm
parents: 16589
diff changeset
   450
  else list_ord string_ord SS;
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   451
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   452
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   453
(* typ_ord *)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   454
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   455
fun typ_ord TU =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   456
  if pointer_eq TU then EQUAL
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   457
  else
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   458
    (case TU of
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   459
      (Type x, Type y) => prod_ord string_ord typs_ord (x, y)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   460
    | (Type _, _) => GREATER
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   461
    | (TFree _, Type _) => LESS
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   462
    | (TFree x, TFree y) => prod_ord string_ord sort_ord (x, y)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   463
    | (TFree _, TVar _) => GREATER
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   464
    | (TVar _, Type _) => LESS
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   465
    | (TVar _, TFree _) => LESS
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   466
    | (TVar x, TVar y) => prod_ord indexname_ord sort_ord (x, y))
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   467
and typs_ord Ts_Us = list_ord typ_ord Ts_Us;
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   468
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   469
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   470
(* term_ord *)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   471
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   472
(*a linear well-founded AC-compatible ordering for terms:
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   473
  s < t <=> 1. size(s) < size(t) or
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   474
            2. size(s) = size(t) and s=f(...) and t=g(...) and f<g or
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   475
            3. size(s) = size(t) and s=f(s1..sn) and t=f(t1..tn) and
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   476
               (s1..sn) < (t1..tn) (lexicographically)*)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   477
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   478
fun dest_hd (Const (a, T)) = (((a, 0), T), 0)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   479
  | dest_hd (Free (a, T)) = (((a, 0), T), 1)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   480
  | dest_hd (Var v) = (v, 2)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   481
  | dest_hd (Bound i) = ((("", i), dummyT), 3)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   482
  | dest_hd (Abs (_, T, _)) = ((("", 0), T), 4);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   483
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   484
fun term_ord tu =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   485
  if pointer_eq tu then EQUAL
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   486
  else
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   487
    (case tu of
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   488
      (Abs (_, T, t), Abs(_, U, u)) =>
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   489
        (case term_ord (t, u) of EQUAL => typ_ord (T, U) | ord => ord)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   490
      | (t, u) =>
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   491
        (case int_ord (size_of_term t, size_of_term u) of
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   492
          EQUAL =>
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   493
            let
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   494
              val (f, ts) = strip_comb t
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   495
              and (g, us) = strip_comb u
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   496
            in case hd_ord (f, g) of EQUAL => terms_ord (ts, us) | ord => ord end
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   497
        | ord => ord))
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   498
and hd_ord (f, g) =
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   499
  prod_ord (prod_ord indexname_ord typ_ord) int_ord (dest_hd f, dest_hd g)
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   500
and terms_ord (ts, us) = list_ord term_ord (ts, us);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   501
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   502
fun op aconv tu = (term_ord tu = EQUAL);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   503
fun aconvs ts_us = (list_ord term_ord ts_us = EQUAL);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   504
fun termless tu = (term_ord tu = LESS);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   505
16570
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   506
(*** Lexicographic path order on terms.
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   507
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   508
  See Baader & Nipkow, Term rewriting, CUP 1998.
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   509
  Without variables.  Const, Var, Bound, Free and Abs are treated all as
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   510
  constants.
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   511
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   512
  f_ord maps strings to integers and serves two purposes:
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   513
  - Predicate on constant symbols.  Those that are not recognised by f_ord
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   514
    must be mapped to ~1.
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   515
  - Order on the recognised symbols.  These must be mapped to distinct
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   516
    integers >= 0.
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   517
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   518
***)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   519
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   520
local
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   521
fun dest_hd f_ord (Const (a, T)) = 
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   522
      let val ord = f_ord a in
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   523
        if ord = ~1 then ((1, ((a, 0), T)), 0) else ((0, (("", ord), T)), 0)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   524
      end
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   525
  | dest_hd _ (Free (a, T)) = ((1, ((a, 0), T)), 0)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   526
  | dest_hd _ (Var v) = ((1, v), 1)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   527
  | dest_hd _ (Bound i) = ((1, (("", i), dummyT)), 2)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   528
  | dest_hd _ (Abs (_, T, _)) = ((1, (("", 0), T)), 3);
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   529
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   530
fun term_lpo f_ord (s, t) =
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   531
  let val (f, ss) = strip_comb s and (g, ts) = strip_comb t in
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   532
    if forall (fn si => term_lpo f_ord (si, t) = LESS) ss
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   533
    then case hd_ord f_ord (f, g) of
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   534
	GREATER =>
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   535
	  if forall (fn ti => term_lpo f_ord (s, ti) = GREATER) ts
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   536
	  then GREATER else LESS
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   537
      | EQUAL =>
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   538
	  if forall (fn ti => term_lpo f_ord (s, ti) = GREATER) ts
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   539
	  then list_ord (term_lpo f_ord) (ss, ts)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   540
	  else LESS
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   541
      | LESS => LESS
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   542
    else GREATER
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   543
  end
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   544
and hd_ord f_ord (f, g) = case (f, g) of
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   545
    (Abs (_, T, t), Abs (_, U, u)) =>
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   546
      (case term_lpo f_ord (t, u) of EQUAL => typ_ord (T, U) | ord => ord)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   547
  | (_, _) => prod_ord (prod_ord int_ord
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   548
                  (prod_ord indexname_ord typ_ord)) int_ord
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   549
                (dest_hd f_ord f, dest_hd f_ord g)
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   550
in
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   551
val term_lpo = term_lpo
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   552
end;
861b9fa2c98c Added term_lpo
nipkow
parents: 16537
diff changeset
   553
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   554
structure Vartab = TableFun(type key = indexname val ord = indexname_ord);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   555
structure Typtab = TableFun(type key = typ val ord = typ_ord);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   556
structure Termtab = TableFun(type key = term val ord = term_ord);
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   557
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   558
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   559
(** Connectives of higher order logic **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   560
375
d7ae7ac22d48 added logicC: class, logicS: sort;
wenzelm
parents: 61
diff changeset
   561
fun itselfT ty = Type ("itself", [ty]);
14854
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14829
diff changeset
   562
val a_itselfT = itselfT (TFree ("'a", []));
375
d7ae7ac22d48 added logicC: class, logicS: sort;
wenzelm
parents: 61
diff changeset
   563
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   564
val propT : typ = Type("prop",[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   565
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   566
val implies = Const("==>", propT-->propT-->propT);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   567
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   568
fun all T = Const("all", (T-->propT)-->propT);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   569
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   570
fun equals T = Const("==", T-->T-->propT);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   571
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   572
(* maps  !!x1...xn. t   to   t  *)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   573
fun strip_all_body (Const("all",_)$Abs(_,_,t))  =  strip_all_body t
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   574
  | strip_all_body t  =  t;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   575
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   576
(* maps  !!x1...xn. t   to   [x1, ..., xn]  *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   577
fun strip_all_vars (Const("all",_)$Abs(a,T,t))  =
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   578
                (a,T) :: strip_all_vars t
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   579
  | strip_all_vars t  =  [] : (string*typ) list;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   580
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   581
(*increments a term's non-local bound variables
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   582
  required when moving a term within abstractions
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   583
     inc is  increment for bound variables
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   584
     lev is  level at which a bound variable is considered 'loose'*)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   585
fun incr_bv (inc, lev, u as Bound i) = if i>=lev then Bound(i+inc) else u
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   586
  | incr_bv (inc, lev, Abs(a,T,body)) =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   587
        Abs(a, T, incr_bv(inc,lev+1,body))
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   588
  | incr_bv (inc, lev, f$t) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   589
      incr_bv(inc,lev,f) $ incr_bv(inc,lev,t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   590
  | incr_bv (inc, lev, u) = u;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   591
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   592
fun incr_boundvars  0  t = t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   593
  | incr_boundvars inc t = incr_bv(inc,0,t);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   594
12981
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   595
(*Scan a pair of terms; while they are similar,
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   596
  accumulate corresponding bound vars in "al"*)
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   597
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) =
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   598
      match_bvs(s, t, if x="" orelse y="" then al
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   599
                                          else (x,y)::al)
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   600
  | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   601
  | match_bvs(_,_,al) = al;
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   602
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   603
(* strip abstractions created by parameters *)
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   604
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al);
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   605
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   606
fun rename_abs pat obj t =
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   607
  let
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   608
    val ren = match_bvs (pat, obj, []);
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   609
    fun ren_abs (Abs (x, T, b)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   610
          Abs (getOpt (assoc_string (ren, x), x), T, ren_abs b)
12981
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   611
      | ren_abs (f $ t) = ren_abs f $ ren_abs t
f48de47c32d6 added match_bvars, rename_abs (from thm.ML);
wenzelm
parents: 12902
diff changeset
   612
      | ren_abs t = t
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
   613
  in if null ren then NONE else SOME (ren_abs t) end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   614
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   615
(*Accumulate all 'loose' bound vars referring to level 'lev' or beyond.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   616
   (Bound 0) is loose at level 0 *)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   617
fun add_loose_bnos (Bound i, lev, js) =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   618
        if i<lev then js  else  (i-lev) ins_int js
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   619
  | add_loose_bnos (Abs (_,_,t), lev, js) = add_loose_bnos (t, lev+1, js)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   620
  | add_loose_bnos (f$t, lev, js) =
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   621
        add_loose_bnos (f, lev, add_loose_bnos (t, lev, js))
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   622
  | add_loose_bnos (_, _, js) = js;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   623
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   624
fun loose_bnos t = add_loose_bnos (t, 0, []);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   625
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   626
(* loose_bvar(t,k) iff t contains a 'loose' bound variable referring to
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   627
   level k or beyond. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   628
fun loose_bvar(Bound i,k) = i >= k
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   629
  | loose_bvar(f$t, k) = loose_bvar(f,k) orelse loose_bvar(t,k)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   630
  | loose_bvar(Abs(_,_,t),k) = loose_bvar(t,k+1)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   631
  | loose_bvar _ = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   632
2792
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2752
diff changeset
   633
fun loose_bvar1(Bound i,k) = i = k
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2752
diff changeset
   634
  | loose_bvar1(f$t, k) = loose_bvar1(f,k) orelse loose_bvar1(t,k)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2752
diff changeset
   635
  | loose_bvar1(Abs(_,_,t),k) = loose_bvar1(t,k+1)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2752
diff changeset
   636
  | loose_bvar1 _ = false;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   637
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   638
(*Substitute arguments for loose bound variables.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   639
  Beta-reduction of arg(n-1)...arg0 into t replacing (Bound i) with (argi).
4626
51dd12f34c78 tuned comments;
wenzelm
parents: 4604
diff changeset
   640
  Note that for ((%x y. c) a b), the bound vars in c are x=1 and y=0
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   641
        and the appropriate call is  subst_bounds([b,a], c) .
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   642
  Loose bound variables >=n are reduced by "n" to
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   643
     compensate for the disappearance of lambdas.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   644
*)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   645
fun subst_bounds (args: term list, t) : term =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   646
  let val n = length args;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   647
      fun subst (t as Bound i, lev) =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   648
           (if i<lev then  t    (*var is locally bound*)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   649
            else  incr_boundvars lev (List.nth(args, i-lev))
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   650
                    handle Subscript => Bound(i-n)  (*loose: change it*))
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   651
        | subst (Abs(a,T,body), lev) = Abs(a, T,  subst(body,lev+1))
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   652
        | subst (f$t, lev) =  subst(f,lev)  $  subst(t,lev)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   653
        | subst (t,lev) = t
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   654
  in   case args of [] => t  | _ => subst (t,0)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   655
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   656
(*Special case: one argument*)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   657
fun subst_bound (arg, t) : term =
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   658
  let fun subst (t as Bound i, lev) =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   659
            if i<lev then  t    (*var is locally bound*)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   660
            else  if i=lev then incr_boundvars lev arg
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   661
                           else Bound(i-1)  (*loose: change it*)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   662
        | subst (Abs(a,T,body), lev) = Abs(a, T,  subst(body,lev+1))
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   663
        | subst (f$t, lev) =  subst(f,lev)  $  subst(t,lev)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   664
        | subst (t,lev) = t
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   665
  in  subst (t,0)  end;
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   666
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   667
(*beta-reduce if possible, else form application*)
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   668
fun betapply (Abs(_,_,t), u) = subst_bound (u,t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   669
  | betapply (f,u) = f$u;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   670
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
   671
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   672
(** Equality, membership and insertion of indexnames (string*ints) **)
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   673
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   674
(*optimized equality test for indexnames.  Yields a huge gain under Poly/ML*)
2959
071bfb16586f tuned type of eq_ix, mem_ix;
wenzelm
parents: 2792
diff changeset
   675
fun eq_ix ((a, i):indexname, (a',i'):indexname) = (a=a') andalso i=i';
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   676
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   677
(*membership in a list, optimized version for indexnames*)
2959
071bfb16586f tuned type of eq_ix, mem_ix;
wenzelm
parents: 2792
diff changeset
   678
fun mem_ix (_, []) = false
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   679
  | mem_ix (x, y :: ys) = eq_ix(x,y) orelse mem_ix (x, ys);
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   680
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   681
(*insertion into list, optimized version for indexnames*)
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   682
fun ins_ix (x,xs) = if mem_ix (x, xs) then xs else x :: xs;
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
   683
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   684
2176
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   685
(** Membership, insertion, union for terms **)
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   686
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   687
fun mem_term (_, []) = false
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   688
  | mem_term (t, t'::ts) = t aconv t' orelse mem_term(t,ts);
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   689
2182
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2176
diff changeset
   690
fun subset_term ([], ys) = true
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2176
diff changeset
   691
  | subset_term (x :: xs, ys) = mem_term (x, ys) andalso subset_term(xs, ys);
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2176
diff changeset
   692
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2176
diff changeset
   693
fun eq_set_term (xs, ys) =
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2176
diff changeset
   694
    xs = ys orelse (subset_term (xs, ys) andalso subset_term (ys, xs));
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2176
diff changeset
   695
2176
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   696
fun ins_term(t,ts) = if mem_term(t,ts) then ts else t :: ts;
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   697
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   698
fun union_term (xs, []) = xs
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   699
  | union_term ([], ys) = ys
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   700
  | union_term ((x :: xs), ys) = union_term (xs, ins_term (x, ys));
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   701
5585
8fcb0f181ad6 new function inter_term
paulson
parents: 4694
diff changeset
   702
fun inter_term ([], ys) = []
8fcb0f181ad6 new function inter_term
paulson
parents: 4694
diff changeset
   703
  | inter_term (x::xs, ys) =
8fcb0f181ad6 new function inter_term
paulson
parents: 4694
diff changeset
   704
      if mem_term (x,ys) then x :: inter_term(xs,ys) else inter_term(xs,ys);
8fcb0f181ad6 new function inter_term
paulson
parents: 4694
diff changeset
   705
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   706
(*A fast unification filter: true unless the two terms cannot be unified.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   707
  Terms must be NORMAL.  Treats all Vars as distinct. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   708
fun could_unify (t,u) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   709
  let fun matchrands (f$t, g$u) = could_unify(t,u) andalso  matchrands(f,g)
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   710
        | matchrands _ = true
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   711
  in case (head_of t , head_of u) of
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   712
        (_, Var _) => true
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   713
      | (Var _, _) => true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   714
      | (Const(a,_), Const(b,_)) =>  a=b andalso matchrands(t,u)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   715
      | (Free(a,_), Free(b,_)) =>  a=b andalso matchrands(t,u)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   716
      | (Bound i, Bound j) =>  i=j andalso matchrands(t,u)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   717
      | (Abs _, _) =>  true   (*because of possible eta equality*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   718
      | (_, Abs _) =>  true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   719
      | _ => false
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   720
  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   721
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   722
(*Substitute new for free occurrences of old in a term*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   723
fun subst_free [] = (fn t=>t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   724
  | subst_free pairs =
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   725
      let fun substf u =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   726
            case gen_assoc (op aconv) (pairs, u) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
   727
                SOME u' => u'
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
   728
              | NONE => (case u of Abs(a,T,t) => Abs(a, T, substf t)
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   729
                                 | t$u' => substf t $ substf u'
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   730
                                 | _ => u)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   731
      in  substf  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   732
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   733
(*a total, irreflexive ordering on index names*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   734
fun xless ((a,i), (b,j): indexname) = i<j  orelse  (i=j andalso a<b);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   735
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   736
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   737
(*Abstraction of the term "body" over its occurrences of v,
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   738
    which must contain no loose bound variables.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   739
  The resulting term is ready to become the body of an Abs.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   740
fun abstract_over (v,body) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   741
  let fun abst (lev,u) = if (v aconv u) then (Bound lev) else
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   742
      (case u of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   743
          Abs(a,T,t) => Abs(a, T, abst(lev+1, t))
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   744
        | f$rand => abst(lev,f) $ abst(lev,rand)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   745
        | _ => u)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   746
  in  abst(0,body)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   747
13665
66e151df01c8 - removed flexpair
berghofe
parents: 13646
diff changeset
   748
fun lambda (v as Free (x, T)) t = Abs (x, T, abstract_over (v, t))
66e151df01c8 - removed flexpair
berghofe
parents: 13646
diff changeset
   749
  | lambda (v as Var ((x, _), T)) t = Abs (x, T, abstract_over (v, t))
66e151df01c8 - removed flexpair
berghofe
parents: 13646
diff changeset
   750
  | lambda v t = raise TERM ("lambda", [v, t]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   751
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   752
(*Form an abstraction over a free variable.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   753
fun absfree (a,T,body) = Abs(a, T, abstract_over (Free(a,T), body));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   754
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   755
(*Abstraction over a list of free variables*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   756
fun list_abs_free ([ ] ,     t) = t
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   757
  | list_abs_free ((a,T)::vars, t) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   758
      absfree(a, T, list_abs_free(vars,t));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   759
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   760
(*Quantification over a list of free variables*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   761
fun list_all_free ([], t: term) = t
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   762
  | list_all_free ((a,T)::vars, t) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   763
        (all T) $ (absfree(a, T, list_all_free(vars,t)));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   764
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   765
(*Quantification over a list of variables (already bound in body) *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   766
fun list_all ([], t) = t
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   767
  | list_all ((a,T)::vars, t) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   768
        (all T) $ (Abs(a, T, list_all(vars,t)));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   769
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   770
(*Replace the ATOMIC term ti by ui;    instl = [(t1,u1), ..., (tn,un)].
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   771
  A simultaneous substitution:  [ (a,b), (b,a) ] swaps a and b.  *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   772
fun subst_atomic [] t = t : term
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   773
  | subst_atomic (instl: (term*term) list) t =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   774
      let fun subst (Abs(a,T,body)) = Abs(a, T, subst body)
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   775
            | subst (f$t') = subst f $ subst t'
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   776
            | subst t = getOpt (assoc(instl,t),t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   777
      in  subst t  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   778
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   779
(*Replace the ATOMIC type Ti by Ui;    instl = [(T1,U1), ..., (Tn,Un)].*)
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   780
fun typ_subst_atomic [] T = T
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   781
  | typ_subst_atomic instl (Type (s, Ts)) =
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   782
      Type (s, map (typ_subst_atomic instl) Ts)
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   783
  | typ_subst_atomic instl T = getOpt (assoc (instl, T), T);
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   784
728
9a973c3ba350 Pure/term: commented typ_subst_TVars, subst_TVars, subst_Vars, subst_vars
lcp
parents: 375
diff changeset
   785
(*Substitute for type Vars in a type*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   786
fun typ_subst_TVars iTs T = if null iTs then T else
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   787
  let fun subst(Type(a,Ts)) = Type(a, map subst Ts)
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   788
        | subst(T as TFree _) = T
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   789
        | subst(T as TVar(ixn,_)) = getOpt (assoc(iTs,ixn),T)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   790
  in subst T end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   791
728
9a973c3ba350 Pure/term: commented typ_subst_TVars, subst_TVars, subst_Vars, subst_vars
lcp
parents: 375
diff changeset
   792
(*Substitute for type Vars in a term*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   793
val subst_TVars = map_term_types o typ_subst_TVars;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   794
728
9a973c3ba350 Pure/term: commented typ_subst_TVars, subst_TVars, subst_Vars, subst_vars
lcp
parents: 375
diff changeset
   795
(*Substitute for Vars in a term; see also envir/norm_term*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   796
fun subst_Vars itms t = if null itms then t else
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   797
  let fun subst(v as Var(ixn,_)) = getOpt (assoc(itms,ixn),v)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   798
        | subst(Abs(a,T,t)) = Abs(a,T,subst t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   799
        | subst(f$t) = subst f $ subst t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   800
        | subst(t) = t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   801
  in subst t end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   802
728
9a973c3ba350 Pure/term: commented typ_subst_TVars, subst_TVars, subst_Vars, subst_vars
lcp
parents: 375
diff changeset
   803
(*Substitute for type/term Vars in a term; see also envir/norm_term*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   804
fun subst_vars(iTs,itms) = if null iTs then subst_Vars itms else
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   805
  let fun subst(Const(a,T)) = Const(a,typ_subst_TVars iTs T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   806
        | subst(Free(a,T)) = Free(a,typ_subst_TVars iTs T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   807
        | subst(v as Var(ixn,T)) = (case assoc(itms,ixn) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
   808
            NONE   => Var(ixn,typ_subst_TVars iTs T)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
   809
          | SOME t => t)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   810
        | subst(b as Bound _) = b
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   811
        | subst(Abs(a,T,t)) = Abs(a,typ_subst_TVars iTs T,subst t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   812
        | subst(f$t) = subst f $ subst t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   813
  in subst end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   814
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   815
15573
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   816
(** Identifying first-order terms **)
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   817
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   818
(*Argument Ts is a reverse list of binder types, needed if term t contains Bound vars*)
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   819
fun has_not_funtype Ts t = not (is_funtype (fastype_of1 (Ts,t)));
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   820
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   821
(*First order means in all terms of the form f(t1,...,tn) no argument has a
16589
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   822
  function type. The supplied quantifiers are excluded: their argument always
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   823
  has a function type through a recursive call into its body.*)
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   824
fun is_first_order quants = 
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   825
  let fun first_order1 Ts (Abs (_,T,body)) = first_order1 (T::Ts) body
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   826
	| first_order1 Ts (Const(q,_) $ Abs(a,T,body)) =
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   827
	    q mem_string quants  andalso   (*it is a known quantifier*)
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   828
            not (is_funtype T)   andalso first_order1 (T::Ts) body
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   829
	| first_order1 Ts t =
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   830
	    case strip_comb t of
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   831
		 (Var _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   832
	       | (Free _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   833
	       | (Const _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   834
	       | (Bound _, ts) => forall (first_order1 Ts andf has_not_funtype Ts) ts
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   835
	       | (Abs _, ts) => false (*not in beta-normal form*)
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   836
	       | _ => error "first_order: unexpected case"
24c32abc8b84 first-order check now allows quantifiers
paulson
parents: 16570
diff changeset
   837
    in  first_order1 []  end;
15573
cf53c2dcf440 new first_order test
paulson
parents: 15570
diff changeset
   838
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   839
(*Computing the maximum index of a typ*)
2146
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   840
fun maxidx_of_typ(Type(_,Ts)) = maxidx_of_typs Ts
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   841
  | maxidx_of_typ(TFree _) = ~1
2146
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   842
  | maxidx_of_typ(TVar((_,i),_)) = i
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   843
and maxidx_of_typs [] = ~1
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   844
  | maxidx_of_typs (T::Ts) = Int.max(maxidx_of_typ T, maxidx_of_typs Ts);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   845
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   846
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   847
(*Computing the maximum index of a term*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   848
fun maxidx_of_term (Const(_,T)) = maxidx_of_typ T
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   849
  | maxidx_of_term (Bound _) = ~1
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   850
  | maxidx_of_term (Free(_,T)) = maxidx_of_typ T
2146
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   851
  | maxidx_of_term (Var ((_,i), T)) = Int.max(i, maxidx_of_typ T)
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   852
  | maxidx_of_term (Abs (_,T,u)) = Int.max(maxidx_of_term u, maxidx_of_typ T)
6854b692f1fe maxidx_of_typs replaces max o map maxidx_of_typ
paulson
parents: 2138
diff changeset
   853
  | maxidx_of_term (f$t) = Int.max(maxidx_of_term f,  maxidx_of_term t);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   854
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   855
fun maxidx_of_terms ts = Library.foldl Int.max (~1, map maxidx_of_term ts);
13665
66e151df01c8 - removed flexpair
berghofe
parents: 13646
diff changeset
   856
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   857
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   858
(* Increment the index of all Poly's in T by k *)
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   859
fun incr_tvar k = map_type_tvar (fn ((a,i),S) => TVar((a,i+k),S));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   860
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   861
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   862
(**** Syntax-related declarations ****)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   863
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   864
(*** Printing ***)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   865
14676
82721f31de3e variant: use Symbol.bump_init;
wenzelm
parents: 14472
diff changeset
   866
(*Makes a variant of a name distinct from the names in bs.
82721f31de3e variant: use Symbol.bump_init;
wenzelm
parents: 14472
diff changeset
   867
  First attaches the suffix and then increments this;
12306
749a04f0cfb0 variant: preserve suffix of underscores (for skolem/internal names etc.);
wenzelm
parents: 11922
diff changeset
   868
  preserves a suffix of underscores "_". *)
749a04f0cfb0 variant: preserve suffix of underscores (for skolem/internal names etc.);
wenzelm
parents: 11922
diff changeset
   869
fun variant bs name =
749a04f0cfb0 variant: preserve suffix of underscores (for skolem/internal names etc.);
wenzelm
parents: 11922
diff changeset
   870
  let
749a04f0cfb0 variant: preserve suffix of underscores (for skolem/internal names etc.);
wenzelm
parents: 11922
diff changeset
   871
    val (c, u) = pairself implode (Library.take_suffix (equal "_") (Symbol.explode name));
12902
a23dc0b7566f Symbol.bump_string;
wenzelm
parents: 12802
diff changeset
   872
    fun vary2 c = if ((c ^ u) mem_string bs) then vary2 (Symbol.bump_string c) else c;
14676
82721f31de3e variant: use Symbol.bump_init;
wenzelm
parents: 14472
diff changeset
   873
    fun vary1 c = if ((c ^ u) mem_string bs) then vary2 (Symbol.bump_init c) else c;
12306
749a04f0cfb0 variant: preserve suffix of underscores (for skolem/internal names etc.);
wenzelm
parents: 11922
diff changeset
   874
  in vary1 (if c = "" then "u" else c) ^ u end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   875
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   876
(*Create variants of the list of names, with priority to the first ones*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   877
fun variantlist ([], used) = []
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
   878
  | variantlist(b::bs, used) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   879
      let val b' = variant used b
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   880
      in  b' :: variantlist (bs, b'::used)  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   881
14695
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   882
(*Invent fresh names*)
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   883
fun invent_names _ _ 0 = []
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   884
  | invent_names used a n =
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   885
      let val b = Symbol.bump_string a in
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   886
        if a mem_string used then invent_names used b n
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   887
        else a :: invent_names used b (n - 1)
9c78044b99c3 improved Term.invent_names;
wenzelm
parents: 14676
diff changeset
   888
      end;
11353
7f6eff7bc97a invent_names
wenzelm
parents: 10806
diff changeset
   889
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
   890
4017
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   891
(** Consts etc. **)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   892
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15573
diff changeset
   893
fun add_typ_classes (Type (_, Ts), cs) = foldr add_typ_classes cs Ts
4017
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   894
  | add_typ_classes (TFree (_, S), cs) = S union cs
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   895
  | add_typ_classes (TVar (_, S), cs) = S union cs;
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   896
16294
97c9f2c1de3d avoid polymorphic ins;
wenzelm
parents: 16108
diff changeset
   897
fun add_typ_tycons (Type (c, Ts), cs) = foldr add_typ_tycons (c ins_string cs) Ts
4017
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   898
  | add_typ_tycons (_, cs) = cs;
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   899
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   900
val add_term_classes = it_term_types add_typ_classes;
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   901
val add_term_tycons = it_term_types add_typ_tycons;
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   902
9319
488e0367a77d add_term_consts: ins_string;
wenzelm
parents: 8609
diff changeset
   903
fun add_term_consts (Const (c, _), cs) = c ins_string cs
4017
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   904
  | add_term_consts (t $ u, cs) = add_term_consts (t, add_term_consts (u, cs))
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   905
  | add_term_consts (Abs (_, _, t), cs) = add_term_consts (t, cs)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   906
  | add_term_consts (_, cs) = cs;
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   907
16108
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   908
fun add_term_constsT (Const c, cs) = c::cs
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   909
  | add_term_constsT (t $ u, cs) = add_term_constsT (t, add_term_constsT (u, cs))
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   910
  | add_term_constsT (Abs (_, _, t), cs) = add_term_constsT (t, cs)
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   911
  | add_term_constsT (_, cs) = cs;
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   912
13646
46ed3d042ba5 Ported find_intro/elim to Isar.
nipkow
parents: 13484
diff changeset
   913
fun term_consts t = add_term_consts(t,[]);
46ed3d042ba5 Ported find_intro/elim to Isar.
nipkow
parents: 13484
diff changeset
   914
16108
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   915
fun term_constsT t = add_term_constsT(t,[]);
cf468b93a02e Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents: 16035
diff changeset
   916
4185
71a79ac5516f added exists_Const
oheimb
parents: 4064
diff changeset
   917
fun exists_Const P t = let
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   918
        fun ex (Const c      ) = P c
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   919
        |   ex (t $ u        ) = ex t orelse ex u
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   920
        |   ex (Abs (_, _, t)) = ex t
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
   921
        |   ex _               = false
4185
71a79ac5516f added exists_Const
oheimb
parents: 4064
diff changeset
   922
    in ex t end;
4017
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   923
4631
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   924
fun exists_subterm P =
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   925
  let fun ex t = P t orelse
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   926
                 (case t of
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   927
                    u $ v        => ex u orelse ex v
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   928
                  | Abs(_, _, u) => ex u
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   929
                  | _            => false)
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   930
  in ex end;
c7fa4ae34495 Improved loop-test for rewrite rules a little.
nipkow
parents: 4626
diff changeset
   931
4017
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   932
(*map classes, tycons*)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   933
fun map_typ f g (Type (c, Ts)) = Type (g c, map (map_typ f g) Ts)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   934
  | map_typ f _ (TFree (x, S)) = TFree (x, map f S)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   935
  | map_typ f _ (TVar (xi, S)) = TVar (xi, map f S);
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   936
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   937
(*map classes, tycons, consts*)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   938
fun map_term f g h (Const (c, T)) = Const (h c, map_typ f g T)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   939
  | map_term f g _ (Free (x, T)) = Free (x, map_typ f g T)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   940
  | map_term f g _ (Var (xi, T)) = Var (xi, map_typ f g T)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   941
  | map_term _ _ _ (t as Bound _) = t
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   942
  | map_term f g h (Abs (x, T, t)) = Abs (x, map_typ f g T, map_term f g h t)
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   943
  | map_term f g h (t $ u) = map_term f g h t $ map_term f g h u;
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   944
63878e2587a7 add_typ_classes, add_typ_tycons, add_term_classes, add_term_tycons,
wenzelm
parents: 3965
diff changeset
   945
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   946
(** TFrees and TVars **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   947
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   948
(*maps  (bs,v)  to   v'::bs    this reverses the identifiers bs*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   949
fun add_new_id (bs, c) : string list =  variant bs c  ::  bs;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   950
12802
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   951
(*Accumulates the names of Frees in the term, suppressing duplicates.*)
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   952
fun add_term_free_names (Free(a,_), bs) = a ins_string bs
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   953
  | add_term_free_names (f$u, bs) = add_term_free_names (f, add_term_free_names(u, bs))
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   954
  | add_term_free_names (Abs(_,_,t), bs) = add_term_free_names(t,bs)
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   955
  | add_term_free_names (_, bs) = bs;
c69bd9754473 added add_term_free_names (more precise/efficient than add_term_names);
wenzelm
parents: 12499
diff changeset
   956
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   957
(*Accumulates the names in the term, suppressing duplicates.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   958
  Includes Frees and Consts.  For choosing unambiguous bound var names.*)
10666
d2a7c5be62be fixed add_term_names: NameSpace.base;
wenzelm
parents: 10552
diff changeset
   959
fun add_term_names (Const(a,_), bs) = NameSpace.base a ins_string bs
2176
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   960
  | add_term_names (Free(a,_), bs) = a ins_string bs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   961
  | add_term_names (f$u, bs) = add_term_names (f, add_term_names(u, bs))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   962
  | add_term_names (Abs(_,_,t), bs) = add_term_names(t,bs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   963
  | add_term_names (_, bs) = bs;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   964
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   965
(*Accumulates the TVars in a type, suppressing duplicates. *)
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15573
diff changeset
   966
fun add_typ_tvars(Type(_,Ts),vs) = foldr add_typ_tvars vs Ts
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   967
  | add_typ_tvars(TFree(_),vs) = vs
16294
97c9f2c1de3d avoid polymorphic ins;
wenzelm
parents: 16108
diff changeset
   968
  | add_typ_tvars(TVar(v),vs) = insert (op =) v vs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   969
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   970
(*Accumulates the TFrees in a type, suppressing duplicates. *)
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15573
diff changeset
   971
fun add_typ_tfree_names(Type(_,Ts),fs) = foldr add_typ_tfree_names fs Ts
2176
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   972
  | add_typ_tfree_names(TFree(f,_),fs) = f ins_string fs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   973
  | add_typ_tfree_names(TVar(_),fs) = fs;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   974
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15573
diff changeset
   975
fun add_typ_tfrees(Type(_,Ts),fs) = foldr add_typ_tfrees fs Ts
16294
97c9f2c1de3d avoid polymorphic ins;
wenzelm
parents: 16108
diff changeset
   976
  | add_typ_tfrees(TFree(f),fs) = insert (op =) f fs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   977
  | add_typ_tfrees(TVar(_),fs) = fs;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   978
15574
b1d1b5bfc464 Removed practically all references to Library.foldr.
skalberg
parents: 15573
diff changeset
   979
fun add_typ_varnames(Type(_,Ts),nms) = foldr add_typ_varnames nms Ts
2176
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   980
  | add_typ_varnames(TFree(nm,_),nms) = nm ins_string nms
43e5c20a593c Changed some mem and ins calls to be monomorphic
paulson
parents: 2146
diff changeset
   981
  | add_typ_varnames(TVar((nm,_),_),nms) = nm ins_string nms;
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   982
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   983
(*Accumulates the TVars in a term, suppressing duplicates. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   984
val add_term_tvars = it_term_types add_typ_tvars;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   985
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   986
(*Accumulates the TFrees in a term, suppressing duplicates. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   987
val add_term_tfrees = it_term_types add_typ_tfrees;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   988
val add_term_tfree_names = it_term_types add_typ_tfree_names;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   989
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   990
val add_term_tvarnames = it_term_types add_typ_varnames;
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   991
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   992
(*Non-list versions*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   993
fun typ_tfrees T = add_typ_tfrees(T,[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   994
fun typ_tvars T = add_typ_tvars(T,[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   995
fun term_tfrees t = add_term_tfrees(t,[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   996
fun term_tvars t = add_term_tvars(t,[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   997
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   998
(*special code to enforce left-to-right collection of TVar-indexnames*)
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
   999
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1000
fun add_typ_ixns(ixns,Type(_,Ts)) = Library.foldl add_typ_ixns (ixns,Ts)
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1001
  | add_typ_ixns(ixns,TVar(ixn,_)) = if mem_ix (ixn, ixns) then ixns
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1002
                                     else ixns@[ixn]
949
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1003
  | add_typ_ixns(ixns,TFree(_)) = ixns;
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1004
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1005
fun add_term_tvar_ixns(Const(_,T),ixns) = add_typ_ixns(ixns,T)
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1006
  | add_term_tvar_ixns(Free(_,T),ixns) = add_typ_ixns(ixns,T)
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1007
  | add_term_tvar_ixns(Var(_,T),ixns) = add_typ_ixns(ixns,T)
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1008
  | add_term_tvar_ixns(Bound _,ixns) = ixns
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1009
  | add_term_tvar_ixns(Abs(_,T,t),ixns) =
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1010
      add_term_tvar_ixns(t,add_typ_ixns(ixns,T))
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1011
  | add_term_tvar_ixns(f$t,ixns) =
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1012
      add_term_tvar_ixns(t,add_term_tvar_ixns(f,ixns));
83c588d6fee9 Changed treatment of during type inference internally generated type
nipkow
parents: 728
diff changeset
  1013
16537
954495db0f07 export sort_ord;
wenzelm
parents: 16338
diff changeset
  1014
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1015
(** Frees and Vars **)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1016
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1017
(*a partial ordering (not reflexive) for atomic terms*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1018
fun atless (Const (a,_), Const (b,_))  =  a<b
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1019
  | atless (Free (a,_), Free (b,_)) =  a<b
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1020
  | atless (Var(v,_), Var(w,_))  =  xless(v,w)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1021
  | atless (Bound i, Bound j)  =   i<j
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1022
  | atless _  =  false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1023
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1024
(*insert atomic term into partially sorted list, suppressing duplicates (?)*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1025
fun insert_aterm (t,us) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1026
  let fun inserta [] = [t]
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1027
        | inserta (us as u::us') =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1028
              if atless(t,u) then t::us
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1029
              else if t=u then us (*duplicate*)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1030
              else u :: inserta(us')
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1031
  in  inserta us  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1032
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1033
(*Accumulates the Vars in the term, suppressing duplicates*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1034
fun add_term_vars (t, vars: term list) = case t of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1035
    Var   _ => insert_aterm(t,vars)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1036
  | Abs (_,_,body) => add_term_vars(body,vars)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1037
  | f$t =>  add_term_vars (f, add_term_vars(t, vars))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1038
  | _ => vars;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1039
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1040
fun term_vars t = add_term_vars(t,[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1041
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1042
(*Accumulates the Frees in the term, suppressing duplicates*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1043
fun add_term_frees (t, frees: term list) = case t of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1044
    Free   _ => insert_aterm(t,frees)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1045
  | Abs (_,_,body) => add_term_frees(body,frees)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1046
  | f$t =>  add_term_frees (f, add_term_frees(t, frees))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1047
  | _ => frees;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1048
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1049
fun term_frees t = add_term_frees(t,[]);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1050
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1051
(*Given an abstraction over P, replaces the bound variable by a Free variable
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1052
  having a unique name. *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1053
fun variant_abs (a,T,P) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1054
  let val b = variant (add_term_names(P,[])) a
2192
3bf092b5310b Optimizations: removal of polymorphic equality; one-argument case
paulson
parents: 2182
diff changeset
  1055
  in  (b,  subst_bound (Free(b,T), P))  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1056
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1057
(* renames and reverses the strings in vars away from names *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1058
fun rename_aTs names vars : (string*typ)list =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1059
  let fun rename_aT (vars,(a,T)) =
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1060
                (variant (map #1 vars @ names) a, T) :: vars
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1061
  in Library.foldl rename_aT ([],vars) end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1062
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1063
fun rename_wrt_term t = rename_aTs (add_term_names(t,[]));
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
  1064
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1065
4286
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1066
(* left-ro-right traversal *)
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1067
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1068
(*foldl atoms of type*)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1069
fun foldl_atyps f (x, Type (_, Ts)) = Library.foldl (foldl_atyps f) (x, Ts)
4286
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1070
  | foldl_atyps f x_atom = f x_atom;
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1071
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1072
(*foldl atoms of term*)
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1073
fun foldl_aterms f (x, t $ u) = foldl_aterms f (foldl_aterms f (x, t), u)
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1074
  | foldl_aterms f (x, Abs (_, _, t)) = foldl_aterms f (x, t)
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1075
  | foldl_aterms f x_atom = f x_atom;
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1076
6548
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1077
fun foldl_map_aterms f (x, t $ u) =
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1078
      let val (x', t') = foldl_map_aterms f (x, t); val (x'', u') = foldl_map_aterms f (x', u);
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1079
      in (x'', t' $ u') end
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1080
  | foldl_map_aterms f (x, Abs (a, T, t)) =
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1081
      let val (x', t') = foldl_map_aterms f (x, t) in (x', Abs (a, T, t')) end
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1082
  | foldl_map_aterms f x_atom = f x_atom;
9b108dd75c25 val foldl_map_aterms: ('a * term -> 'a * term) -> 'a * term -> 'a * term;
wenzelm
parents: 6033
diff changeset
  1083
4286
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1084
(*foldl types of term*)
8609
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1085
fun foldl_term_types f (x, t as Const (_, T)) = f t (x, T)
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1086
  | foldl_term_types f (x, t as Free (_, T)) = f t (x, T)
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1087
  | foldl_term_types f (x, t as Var (_, T)) = f t (x, T)
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1088
  | foldl_term_types f (x, Bound _) = x
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1089
  | foldl_term_types f (x, t as Abs (_, T, b)) = foldl_term_types f (f t (x, T), b)
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1090
  | foldl_term_types f (x, t $ u) = foldl_term_types f (foldl_term_types f (x, t), u);
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1091
ec57bc9340e8 foldl_term_types: depend on term as well;
wenzelm
parents: 8408
diff changeset
  1092
fun foldl_types f = foldl_term_types (fn _ => f);
4286
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1093
12499
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
  1094
(*collect variables*)
16294
97c9f2c1de3d avoid polymorphic ins;
wenzelm
parents: 16108
diff changeset
  1095
val add_tvarsT = foldl_atyps (fn (vs, TVar v) => insert (op =) v vs | (vs, _) => vs);
12499
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
  1096
val add_tvars = foldl_types add_tvarsT;
16294
97c9f2c1de3d avoid polymorphic ins;
wenzelm
parents: 16108
diff changeset
  1097
val add_vars = foldl_aterms (fn (vs, Var v) => insert (op =) v vs | (vs, _) => vs);
97c9f2c1de3d avoid polymorphic ins;
wenzelm
parents: 16108
diff changeset
  1098
val add_frees = foldl_aterms (fn (vs, Free v) => insert (op =) v vs | (vs, _) => vs);
12499
1b56e1732a61 added invent_type_names;
wenzelm
parents: 12306
diff changeset
  1099
15025
b2ef0bc6f59f added add_term_varnames, term_varnames;
wenzelm
parents: 14854
diff changeset
  1100
(*collect variable names*)
b2ef0bc6f59f added add_term_varnames, term_varnames;
wenzelm
parents: 14854
diff changeset
  1101
val add_term_varnames = foldl_aterms (fn (xs, Var (x, _)) => ins_ix (x, xs) | (xs, _) => xs);
b2ef0bc6f59f added add_term_varnames, term_varnames;
wenzelm
parents: 14854
diff changeset
  1102
fun term_varnames t = add_term_varnames ([], t);
4286
a09e3e6da2de added foldl_atyps: ('a * typ -> 'a) -> 'a * typ -> 'a;
wenzelm
parents: 4188
diff changeset
  1103
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1104
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
  1105
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1106
(*** Compression of terms and types by sharing common subtrees.
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1107
     Saves 50-75% on storage requirements.  As it is a bit slow,
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1108
     it should be called only for axioms, stored theorems, etc.
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1109
     Recorded term and type fragments are never disposed. ***)
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1110
16338
3d1851acb4d0 map_typ and map_term no longer global;
wenzelm
parents: 16294
diff changeset
  1111
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1112
(** Sharing of types **)
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1113
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1114
val memo_types = ref (Typtab.empty: typ Typtab.table);
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1115
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1116
fun compress_type T =
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1117
  (case Typtab.lookup (! memo_types, T) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
  1118
    SOME T' => T'
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
  1119
  | NONE =>
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1120
      let val T' = (case T of Type (a, Ts) => Type (a, map compress_type Ts) | _ => T)
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1121
      in memo_types := Typtab.update ((T', T'), ! memo_types); T' end);
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1122
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1123
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1124
(** Sharing of atomic terms **)
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1125
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1126
val memo_terms = ref (Termtab.empty : term Termtab.table);
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1127
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1128
fun share_term (t $ u) = share_term t $ share_term u
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1129
  | share_term (Abs (a, T, u)) = Abs (a, T, share_term u)
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1130
  | share_term t =
13000
e56aedec11f3 structure Typtab;
wenzelm
parents: 12981
diff changeset
  1131
      (case Termtab.lookup (! memo_terms, t) of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
  1132
        SOME t' => t'
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15472
diff changeset
  1133
      | NONE => (memo_terms := Termtab.update ((t, t), ! memo_terms); t));
1417
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1134
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1135
val compress_term = share_term o map_term_types compress_type;
c0f6a1887518 Addition of compression, that is, sharing.
paulson
parents: 1391
diff changeset
  1136
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
  1137
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1138
(* dummy patterns *)
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1139
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1140
val dummy_patternN = "dummy_pattern";
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1141
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1142
fun is_dummy_pattern (Const ("dummy_pattern", _)) = true
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1143
  | is_dummy_pattern _ = false;
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1144
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1145
fun no_dummy_patterns tm =
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1146
  if not (foldl_aterms (fn (b, t) => b orelse is_dummy_pattern t) (false, tm)) then tm
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1147
  else raise TERM ("Illegal occurrence of '_' dummy pattern", [tm]);
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1148
11903
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1149
fun replace_dummy Ts (i, Const ("dummy_pattern", T)) =
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1150
      (i + 1, list_comb (Var (("_dummy_", i), Ts ---> T), map Bound (0 upto length Ts - 1)))
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1151
  | replace_dummy Ts (i, Abs (x, T, t)) =
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1152
      let val (i', t') = replace_dummy (T :: Ts) (i, t)
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1153
      in (i', Abs (x, T, t')) end
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1154
  | replace_dummy Ts (i, t $ u) =
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1155
      let val (i', t') = replace_dummy Ts (i, t); val (i'', u') = replace_dummy Ts (i', u)
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1156
      in (i'', t' $ u') end
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1157
  | replace_dummy _ (i, a) = (i, a);
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1158
938dd8bca661 replace_dummy_patterns: lift over bounds;
wenzelm
parents: 11353
diff changeset
  1159
val replace_dummy_patterns = replace_dummy [];
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1160
10552
a177b8571026 added is_replaced_dummy_pattern;
wenzelm
parents: 9721
diff changeset
  1161
fun is_replaced_dummy_pattern ("_dummy_", _) = true
a177b8571026 added is_replaced_dummy_pattern;
wenzelm
parents: 9721
diff changeset
  1162
  | is_replaced_dummy_pattern _ = false;
9536
b79b002f32ae added dummy_patternN, no_dummy_patterns, replace_dummy_patterns;
wenzelm
parents: 9319
diff changeset
  1163
16035
31bd65f7b22a added show_dummy_patterns;
wenzelm
parents: 15986
diff changeset
  1164
fun show_dummy_patterns (Var (("_dummy_", _), T)) = Const ("dummy_pattern", T)
31bd65f7b22a added show_dummy_patterns;
wenzelm
parents: 15986
diff changeset
  1165
  | show_dummy_patterns (t $ u) = show_dummy_patterns t $ show_dummy_patterns u
31bd65f7b22a added show_dummy_patterns;
wenzelm
parents: 15986
diff changeset
  1166
  | show_dummy_patterns (Abs (x, T, t)) = Abs (x, T, show_dummy_patterns t)
31bd65f7b22a added show_dummy_patterns;
wenzelm
parents: 15986
diff changeset
  1167
  | show_dummy_patterns a = a;
31bd65f7b22a added show_dummy_patterns;
wenzelm
parents: 15986
diff changeset
  1168
13484
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1169
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1170
(* adhoc freezing *)
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1171
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1172
fun adhoc_freeze_vars tm =
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1173
  let
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1174
    fun mk_inst (var as Var ((a, i), T)) =
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1175
      let val x = a ^ Library.gensym "_" ^ string_of_int i
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1176
      in ((var,  Free(x, T)), x) end;
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1177
    val (insts, xs) = split_list (map mk_inst (term_vars tm));
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1178
  in (subst_atomic insts tm, xs) end;
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1179
d8f5d3391766 adhoc_freeze_vars;
wenzelm
parents: 13000
diff changeset
  1180
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1181
(* string_of_vname *)
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1182
15986
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1183
val show_question_marks = ref true;
15472
4674102737e9 Added show_var_qmarks flag.
berghofe
parents: 15025
diff changeset
  1184
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1185
fun string_of_vname (x, i) =
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1186
  let
15986
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1187
    val question_mark = if ! show_question_marks then "?" else "";
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1188
    val idx = string_of_int i;
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1189
    val dot =
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1190
      (case rev (Symbol.explode x) of
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1191
        _ :: "\\<^isub>" :: _ => false
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1192
      | _ :: "\\<^isup>" :: _ => false
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1193
      | c :: _ => Symbol.is_digit c
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1194
      | _ => true);
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1195
  in
15986
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1196
    if dot then question_mark ^ x ^ "." ^ idx
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1197
    else if i <> 0 then question_mark ^ x ^ idx
db3cd4fa9b19 renamed show_var_qmarks to show_question_marks;
wenzelm
parents: 15962
diff changeset
  1198
    else question_mark ^ x
14786
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1199
  end;
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1200
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1201
fun string_of_vname' (x, ~1) = x
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1202
  | string_of_vname' xi = string_of_vname xi;
24a7bc97a27a moved some sort ops to sorts.ML; added string_of_vname (from Syntax module);
wenzelm
parents: 14695
diff changeset
  1203
15612
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1204
fun string_of_term (Const(s,_)) = s
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1205
  | string_of_term (Free(s,_)) = s
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1206
  | string_of_term (Var(ix,_)) = string_of_vname ix
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1207
  | string_of_term (Bound i) = string_of_int i
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1208
  | string_of_term (Abs(x,_,t)) = "%" ^ x ^ ". " ^ string_of_term t
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1209
  | string_of_term (s $ t) =
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1210
      "(" ^ string_of_term s ^ " " ^ string_of_term t ^ ")"
431b281078b3 added string_of_term
nipkow
parents: 15598
diff changeset
  1211
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
  1212
end;
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1029
diff changeset
  1213
4444
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
  1214
structure BasicTerm: BASIC_TERM = Term;
fa05a79b3e97 term order;
wenzelm
parents: 4286
diff changeset
  1215
open BasicTerm;