Univ.thy
author clasohm
Thu, 08 Dec 1994 12:50:38 +0100
changeset 199 ad45e477926c
parent 190 5505c746fff7
child 249 492493334e0f
permissions -rw-r--r--
replaced store_thm by bind_thm
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
     1
(*  Title:      HOL/Univ.thy
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1993  University of Cambridge
7949f97df77a Initial revision
clasohm
parents:
diff changeset
     5
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
     6
Move LEAST to Nat.thy???  Could it be defined for all types 'a::ord?
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
     7
7949f97df77a Initial revision
clasohm
parents:
diff changeset
     8
Declares the type 'a node, a subtype of (nat=>nat) * ('a+nat)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
     9
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    10
Defines "Cartesian Product" and "Disjoint Sum" as set operations.
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    11
Could <*> be generalized to a general summation (Sigma)?
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    12
*)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    13
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    14
Univ = Arith + Sum +
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    15
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    16
(** lists, trees will be sets of nodes **)
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    17
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    18
subtype (Node)
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    19
  'a node = "{p. EX f x k. p = <f::nat=>nat, x::'a+nat> & f(k)=0}"
51
934a58983311 new type declaration syntax instead of numbers
lcp
parents: 48
diff changeset
    20
934a58983311 new type declaration syntax instead of numbers
lcp
parents: 48
diff changeset
    21
types
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    22
  'a item = "'a node set"
51
934a58983311 new type declaration syntax instead of numbers
lcp
parents: 48
diff changeset
    23
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    24
consts
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    25
  Least     :: "(nat=>bool) => nat"    (binder "LEAST " 10)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    26
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    27
  apfst     :: "['a=>'c, 'a*'b] => 'c*'b"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    28
  Push      :: "[nat, nat=>nat] => (nat=>nat)"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    29
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    30
  Push_Node :: "[nat, 'a node] => 'a node"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    31
  ndepth    :: "'a node => nat"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    32
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    33
  Atom      :: "('a+nat) => 'a item"
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    34
  Leaf      :: "'a => 'a item"
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    35
  Numb      :: "nat => 'a item"
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    36
  "$"       :: "['a item, 'a item]=> 'a item"   (infixr 60)
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    37
  In0,In1   :: "'a item => 'a item"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    38
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    39
  ntrunc    :: "[nat, 'a item] => 'a item"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    40
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    41
  "<*>"  :: "['a item set, 'a item set]=> 'a item set" (infixr 80)
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    42
  "<+>"  :: "['a item set, 'a item set]=> 'a item set" (infixr 70)
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    43
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    44
  Split  :: "[['a item, 'a item]=>'b, 'a item] => 'b"
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    45
  Case   :: "[['a item]=>'b, ['a item]=>'b, 'a item] => 'b"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    46
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    47
  diag   :: "'a set => ('a * 'a)set"
128
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    48
  "<**>" :: "[('a item * 'a item)set, ('a item * 'a item)set] \
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    49
\           => ('a item * 'a item)set" (infixr 80)
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    50
  "<++>" :: "[('a item * 'a item)set, ('a item * 'a item)set] \
89669c58e506 INSTALLATION OF INDUCTIVE DEFINITIONS
lcp
parents: 111
diff changeset
    51
\           => ('a item * 'a item)set" (infixr 70)
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    52
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    53
defs
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    54
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    55
  (*least number operator*)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    56
  Least_def        "Least(P) == @k. P(k) & (ALL j. j<k --> ~P(j))"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    57
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    58
  Push_Node_def    "Push_Node == (%n x. Abs_Node (apfst(Push(n),Rep_Node(x))))"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    59
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    60
  (*crude "lists" of nats -- needed for the constructions*)
111
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
    61
  apfst_def  "apfst == (%f. split(%x y. <f(x),y>))"
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
    62
  Push_def   "Push == (%b h. nat_case(Suc(b),h))"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    63
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    64
  (** operations on S-expressions -- sets of nodes **)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    65
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    66
  (*S-expression constructors*)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    67
  Atom_def   "Atom == (%x. {Abs_Node(<%k.0, x>)})"
48
21291189b51e changed "." to "$" and Cons to infix "#" to eliminate ambiguity
clasohm
parents: 0
diff changeset
    68
  Scons_def  "M$N == (Push_Node(0) `` M) Un (Push_Node(Suc(0)) `` N)"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    69
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    70
  (*Leaf nodes, with arbitrary or nat labels*)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    71
  Leaf_def   "Leaf == Atom o Inl"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    72
  Numb_def   "Numb == Atom o Inr"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    73
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    74
  (*Injections of the "disjoint sum"*)
48
21291189b51e changed "." to "$" and Cons to infix "#" to eliminate ambiguity
clasohm
parents: 0
diff changeset
    75
  In0_def    "In0(M) == Numb(0) $ M"
21291189b51e changed "." to "$" and Cons to infix "#" to eliminate ambiguity
clasohm
parents: 0
diff changeset
    76
  In1_def    "In1(M) == Numb(Suc(0)) $ M"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    77
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    78
  (*the set of nodes with depth less than k*)
111
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
    79
  ndepth_def "ndepth(n) == split(%f x. LEAST k. f(k)=0, Rep_Node(n))"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    80
  ntrunc_def "ntrunc(k,N) == {n. n:N & ndepth(n)<k}"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    81
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    82
  (*products and sums for the "universe"*)
48
21291189b51e changed "." to "$" and Cons to infix "#" to eliminate ambiguity
clasohm
parents: 0
diff changeset
    83
  uprod_def  "A<*>B == UN x:A. UN y:B. { (x$y) }"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    84
  usum_def   "A<+>B == In0``A Un In1``B"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    85
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    86
  (*the corresponding eliminators*)
111
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
    87
  Split_def  "Split(c,M) == @u. ? x y. M = x$y & u = c(x,y)"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    88
190
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    89
  Case_def   "Case(c,d,M) == @u.  (? x . M = In0(x) & u = c(x)) \
5505c746fff7 adapted to 'subtype' section;
wenzelm
parents: 128
diff changeset
    90
\                               | (? y . M = In1(y) & u = d(y))"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    91
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    92
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    93
  (** diagonal sets and equality for the "universe" **)
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    94
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    95
  diag_def   "diag(A) == UN x:A. {<x,x>}"
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    96
111
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
    97
  dprod_def  "r<**>s == UN u:r. split(%x x'. \
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
    98
\                       UN v:s. split(%y y'. {<x$y,x'$y'>}, v), u)"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
    99
111
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
   100
  dsum_def   "r<++>s == (UN u:r. split(%x x'. {<In0(x),In0(x')>}, u)) Un \
361521bc7c47 HOL/Univ: swapped args of split and simplified
lcp
parents: 51
diff changeset
   101
\                       (UN v:s. split(%y y'. {<In1(y),In1(y')>}, v))"
0
7949f97df77a Initial revision
clasohm
parents:
diff changeset
   102
7949f97df77a Initial revision
clasohm
parents:
diff changeset
   103
end