src/HOL/List.thy
author paulson
Wed, 15 Jul 1998 14:19:02 +0200
changeset 5148 74919e8f221c
parent 5077 71043526295f
child 5162 53e505c6019c
permissions -rw-r--r--
More tidying and removal of "\!\!... from Goal commands
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     1
(*  Title:      HOL/List.thy
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     2
    ID:         $Id$
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     3
    Author:     Tobias Nipkow
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
    Copyright   1994 TU Muenchen
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     5
2512
0231e4f467f2 Got rid of Alls in List.
nipkow
parents: 2369
diff changeset
     6
The datatype of finite lists.
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     7
*)
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     8
4643
1b40fcac5a09 New induction schemas for lists (length and snoc).
nipkow
parents: 4605
diff changeset
     9
List = WF_Rel +
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    10
977
5d57287e5e1e changed syntax of datatype declarations (curried types for constructor
clasohm
parents: 965
diff changeset
    11
datatype 'a list = "[]" ("[]") | "#" 'a ('a list) (infixr 65)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    12
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    13
consts
1908
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    14
  "@"         :: ['a list, 'a list] => 'a list            (infixr 65)
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    15
  filter      :: ['a => bool, 'a list] => 'a list
2608
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
    16
  concat      :: 'a list list => 'a list
1908
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    17
  foldl       :: [['b,'a] => 'b, 'b, 'a list] => 'b
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    18
  hd, last    :: 'a list => 'a
3465
e85c24717cad set_of_list -> set
nipkow
parents: 3437
diff changeset
    19
  set         :: 'a list => 'a set
1908
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    20
  list_all    :: ('a => bool) => ('a list => bool)
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    21
  map         :: ('a=>'b) => ('a list => 'b list)
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    22
  mem         :: ['a, 'a list] => bool                    (infixl 55)
4502
337c073de95e nth -> !
nipkow
parents: 4151
diff changeset
    23
  nth         :: ['a list, nat] => 'a			  (infixl "!" 100)
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    24
  list_update :: 'a list => nat => 'a => 'a list
2608
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
    25
  take, drop  :: [nat, 'a list] => 'a list
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
    26
  takeWhile,
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
    27
  dropWhile   :: ('a => bool) => 'a list => 'a list
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    28
  tl, butlast :: 'a list => 'a list
1908
55d8e38262a8 Renamed setOfList to set_of_list
paulson
parents: 1898
diff changeset
    29
  rev         :: 'a list => 'a list
4132
daff3c9987cc added zip and nodup
oheimb
parents: 3896
diff changeset
    30
  zip	      :: "'a list => 'b list => ('a * 'b) list"
4605
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
    31
  remdups     :: 'a list => 'a list
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
    32
  nodups      :: "'a list => bool"
3589
244daa75f890 Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents: 3584
diff changeset
    33
  replicate   :: nat => 'a => 'a list
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    34
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    35
nonterminals
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    36
  lupdbinds  lupdbind
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    37
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    38
syntax
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    39
  (* list Enumeration *)
2262
c7ee913746fd added symbols syntax;
wenzelm
parents: 1908
diff changeset
    40
  "@list"     :: args => 'a list                          ("[(_)]")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    41
2512
0231e4f467f2 Got rid of Alls in List.
nipkow
parents: 2369
diff changeset
    42
  (* Special syntax for filter *)
2262
c7ee913746fd added symbols syntax;
wenzelm
parents: 1908
diff changeset
    43
  "@filter"   :: [idt, 'a list, bool] => 'a list          ("(1[_:_ ./ _])")
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    44
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    45
  (* list update *)
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    46
  "_lupdbind"      :: ['a, 'a] => lupdbind            ("(2_ :=/ _)")
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    47
  ""               :: lupdbind => lupdbinds           ("_")
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    48
  "_lupdbinds"     :: [lupdbind, lupdbinds] => lupdbinds ("_,/ _")
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    49
  "_LUpdate"       :: ['a, lupdbinds] => 'a           ("_/[(_)]" [900,0] 900)
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    50
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    51
translations
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    52
  "[x, xs]"     == "x#[xs]"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    53
  "[x]"         == "x#[]"
3842
b55686a7b22c fixed dots;
wenzelm
parents: 3589
diff changeset
    54
  "[x:xs . P]"  == "filter (%x. P) xs"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    55
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    56
  "_LUpdate xs (_lupdbinds b bs)"  == "_LUpdate (_LUpdate xs b) bs"
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    57
  "xs[i:=x]"                       == "list_update xs i x"
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
    58
2262
c7ee913746fd added symbols syntax;
wenzelm
parents: 1908
diff changeset
    59
syntax (symbols)
c7ee913746fd added symbols syntax;
wenzelm
parents: 1908
diff changeset
    60
  "@filter"   :: [idt, 'a list, bool] => 'a list          ("(1[_\\<in>_ ./ _])")
c7ee913746fd added symbols syntax;
wenzelm
parents: 1908
diff changeset
    61
c7ee913746fd added symbols syntax;
wenzelm
parents: 1908
diff changeset
    62
3342
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    63
consts
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    64
  lists        :: 'a set => 'a list set
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    65
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    66
  inductive "lists A"
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    67
  intrs
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    68
    Nil  "[]: lists A"
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    69
    Cons "[| a: A;  l: lists A |] ==> a#l : lists A"
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    70
ec3b55fcb165 New operator "lists" for formalizing sets of lists
paulson
parents: 3320
diff changeset
    71
3437
bea2faf1641d Replacing the primrec definition of "length" by a translation to the built-in
paulson
parents: 3401
diff changeset
    72
(*Function "size" is overloaded for all datatypes.  Users may refer to the
bea2faf1641d Replacing the primrec definition of "length" by a translation to the built-in
paulson
parents: 3401
diff changeset
    73
  list version as "length".*)
bea2faf1641d Replacing the primrec definition of "length" by a translation to the built-in
paulson
parents: 3401
diff changeset
    74
syntax   length :: 'a list => nat
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
    75
translations  "length"  =>  "size:: _ list => nat"
3437
bea2faf1641d Replacing the primrec definition of "length" by a translation to the built-in
paulson
parents: 3401
diff changeset
    76
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    77
primrec hd list
3320
3a5e4930fb77 Added `arbitrary'
nipkow
parents: 3196
diff changeset
    78
  "hd([]) = arbitrary"
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
    79
  "hd(x#xs) = x"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    80
primrec tl list
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    81
  "tl([]) = []"
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
    82
  "tl(x#xs) = xs"
3896
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    83
primrec last list
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    84
  "last [] = arbitrary"
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    85
  "last(x#xs) = (if xs=[] then x else last xs)"
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    86
primrec butlast list
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    87
  "butlast [] = []"
ee8ebb74ec00 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow
parents: 3842
diff changeset
    88
  "butlast(x#xs) = (if xs=[] then [] else x#butlast xs)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    89
primrec "op mem" list
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
    90
  "x mem [] = False"
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
    91
  "x mem (y#ys) = (if y=x then True else x mem ys)"
3465
e85c24717cad set_of_list -> set
nipkow
parents: 3437
diff changeset
    92
primrec set list
e85c24717cad set_of_list -> set
nipkow
parents: 3437
diff changeset
    93
  "set [] = {}"
e85c24717cad set_of_list -> set
nipkow
parents: 3437
diff changeset
    94
  "set (x#xs) = insert x (set xs)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    95
primrec list_all list
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    96
  list_all_Nil  "list_all P [] = True"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    97
  list_all_Cons "list_all P (x#xs) = (P(x) & list_all P xs)"
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    98
primrec map list
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
    99
  "map f [] = []"
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   100
  "map f (x#xs) = f(x)#map f xs"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   101
primrec "op @" list
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   102
  "[] @ ys = ys"
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   103
  "(x#xs)@ys = x#(xs@ys)"
1169
5873833cf37f Added function rev and its properties length_rev, etc.
lcp
parents: 977
diff changeset
   104
primrec rev list
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   105
  "rev([]) = []"
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   106
  "rev(x#xs) = rev(xs) @ [x]"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   107
primrec filter list
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   108
  "filter P [] = []"
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   109
  "filter P (x#xs) = (if P x then x#filter P xs else filter P xs)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   110
primrec foldl list
1898
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   111
  "foldl f a [] = a"
260a9711f507 Simplified primrec definitions.
berghofe
parents: 1824
diff changeset
   112
  "foldl f a (x#xs) = foldl f (f a x) xs"
2608
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   113
primrec concat list
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   114
  "concat([]) = []"
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   115
  "concat(x#xs) = x @ concat(xs)"
1419
a6a034a47a71 defined take/drop by induction over list rather than nat.
nipkow
parents: 1370
diff changeset
   116
primrec drop list
a6a034a47a71 defined take/drop by induction over list rather than nat.
nipkow
parents: 1370
diff changeset
   117
  drop_Nil  "drop n [] = []"
a6a034a47a71 defined take/drop by induction over list rather than nat.
nipkow
parents: 1370
diff changeset
   118
  drop_Cons "drop n (x#xs) = (case n of 0 => x#xs | Suc(m) => drop m xs)"
a6a034a47a71 defined take/drop by induction over list rather than nat.
nipkow
parents: 1370
diff changeset
   119
primrec take list
a6a034a47a71 defined take/drop by induction over list rather than nat.
nipkow
parents: 1370
diff changeset
   120
  take_Nil  "take n [] = []"
a6a034a47a71 defined take/drop by induction over list rather than nat.
nipkow
parents: 1370
diff changeset
   121
  take_Cons "take n (x#xs) = (case n of 0 => [] | Suc(m) => x # take m xs)"
2738
e28a0668dbfe primrec definition for nth
pusch
parents: 2608
diff changeset
   122
primrec nth nat
4502
337c073de95e nth -> !
nipkow
parents: 4151
diff changeset
   123
  "xs!0 = hd xs"
337c073de95e nth -> !
nipkow
parents: 4151
diff changeset
   124
  "xs!(Suc n) = (tl xs)!n"
5077
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
   125
primrec list_update list
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
   126
 "    [][i:=v] = []"
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
   127
 "(x#xs)[i:=v] = (case i of 0     => v # xs 
71043526295f * HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents: 4643
diff changeset
   128
			  | Suc j => x # xs[j:=v])"
2608
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   129
primrec takeWhile list
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   130
  "takeWhile P [] = []"
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   131
  "takeWhile P (x#xs) = (if P x then x#takeWhile P xs else [])"
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   132
primrec dropWhile list
450c9b682a92 New class "order" and accompanying changes.
nipkow
parents: 2512
diff changeset
   133
  "dropWhile P [] = []"
3584
8f9ee0f79d9a Corected bug in def of dropWhile (also present in Haskell lib!)
nipkow
parents: 3507
diff changeset
   134
  "dropWhile P (x#xs) = (if P x then dropWhile P xs else x#xs)"
4132
daff3c9987cc added zip and nodup
oheimb
parents: 3896
diff changeset
   135
primrec zip list
daff3c9987cc added zip and nodup
oheimb
parents: 3896
diff changeset
   136
  "zip xs []     = []"
daff3c9987cc added zip and nodup
oheimb
parents: 3896
diff changeset
   137
  "zip xs (y#ys) = (hd xs,y)#zip (tl xs) ys"
4605
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
   138
primrec nodups list
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
   139
  "nodups []     = True"
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
   140
  "nodups (x#xs) = (x ~: set xs & nodups xs)"
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
   141
primrec remdups list
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
   142
  "remdups [] = []"
579e0ef2df6b Added `remdups'
nipkow
parents: 4502
diff changeset
   143
  "remdups (x#xs) = (if x : set xs then remdups xs else x # remdups xs)"
3589
244daa75f890 Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents: 3584
diff changeset
   144
primrec replicate nat
244daa75f890 Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents: 3584
diff changeset
   145
replicate_0   "replicate 0 x       = []"
244daa75f890 Added function `replicate' and lemmas map_cong and set_replicate.
nipkow
parents: 3584
diff changeset
   146
replicate_Suc "replicate (Suc n) x = x # replicate n x"
3196
c522bc46aea7 Added pred_list for TFL
paulson
parents: 2738
diff changeset
   147
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   148
end
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   149
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   150
ML
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   151
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   152
local
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   153
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   154
(* translating size::list -> length *)
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   155
4151
5c19cd418c33 adapted typed_print_translation;
wenzelm
parents: 4132
diff changeset
   156
fun size_tr' _ (Type ("fun", (Type ("list", _) :: _))) [t] =
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   157
      Syntax.const "length" $ t
4151
5c19cd418c33 adapted typed_print_translation;
wenzelm
parents: 4132
diff changeset
   158
  | size_tr' _ _ _ = raise Match;
3507
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   159
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   160
in
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   161
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   162
val typed_print_translation = [("size", size_tr')];
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   163
157be29ad5ba Improved length = size translation.
nipkow
parents: 3465
diff changeset
   164
end;