src/CCL/Wfd.thy
changeset 17456 bcf7544875b2
parent 3837 d7f033c74b38
child 20140 98acc6d0fab6
equal deleted inserted replaced
17455:151e76f0e3c7 17456:bcf7544875b2
     1 (*  Title:      CCL/wfd.thy
     1 (*  Title:      CCL/Wfd.thy
     2     ID:         $Id$
     2     ID:         $Id$
     3     Author:     Martin Coen, Cambridge University Computer Laboratory
     3     Author:     Martin Coen, Cambridge University Computer Laboratory
     4     Copyright   1993  University of Cambridge
     4     Copyright   1993  University of Cambridge
     5 
       
     6 Well-founded relations in CCL.
       
     7 *)
     5 *)
     8 
     6 
     9 Wfd = Trancl + Type +
     7 header {* Well-founded relations in CCL *}
       
     8 
       
     9 theory Wfd
       
    10 imports Trancl Type Hered
       
    11 uses ("wfd.ML") ("genrec.ML") ("typecheck.ML") ("eval.ML")
       
    12 begin
    10 
    13 
    11 consts
    14 consts
    12       (*** Predicates ***)
    15       (*** Predicates ***)
    13   Wfd        ::       "[i set] => o"
    16   Wfd        ::       "[i set] => o"
    14       (*** Relations ***)
    17       (*** Relations ***)
    16   wmap       ::       "[i=>i,i set] => i set"
    19   wmap       ::       "[i=>i,i set] => i set"
    17   "**"       ::       "[i set,i set] => i set"      (infixl 70)
    20   "**"       ::       "[i set,i set] => i set"      (infixl 70)
    18   NatPR      ::       "i set"
    21   NatPR      ::       "i set"
    19   ListPR     ::       "i set => i set"
    22   ListPR     ::       "i set => i set"
    20 
    23 
    21 rules
    24 axioms
    22 
    25 
    23   Wfd_def
    26   Wfd_def:
    24   "Wfd(R) == ALL P.(ALL x.(ALL y.<y,x> : R --> y:P) --> x:P) --> (ALL a. a:P)"
    27   "Wfd(R) == ALL P.(ALL x.(ALL y.<y,x> : R --> y:P) --> x:P) --> (ALL a. a:P)"
    25 
    28 
    26   wf_def         "wf(R) == {x. x:R & Wfd(R)}"
    29   wf_def:         "wf(R) == {x. x:R & Wfd(R)}"
    27 
    30 
    28   wmap_def       "wmap(f,R) == {p. EX x y. p=<x,y>  &  <f(x),f(y)> : R}"
    31   wmap_def:       "wmap(f,R) == {p. EX x y. p=<x,y>  &  <f(x),f(y)> : R}"
    29   lex_def
    32   lex_def:
    30   "ra**rb == {p. EX a a' b b'. p = <<a,b>,<a',b'>> & (<a,a'> : ra | (a=a' & <b,b'> : rb))}"
    33   "ra**rb == {p. EX a a' b b'. p = <<a,b>,<a',b'>> & (<a,a'> : ra | (a=a' & <b,b'> : rb))}"
    31 
    34 
    32   NatPR_def      "NatPR == {p. EX x:Nat. p=<x,succ(x)>}"
    35   NatPR_def:      "NatPR == {p. EX x:Nat. p=<x,succ(x)>}"
    33   ListPR_def     "ListPR(A) == {p. EX h:A. EX t:List(A). p=<t,h$t>}"
    36   ListPR_def:     "ListPR(A) == {p. EX h:A. EX t:List(A). p=<t,h$t>}"
       
    37 
       
    38 ML {* use_legacy_bindings (the_context ()) *}
       
    39 
       
    40 use "wfd.ML"
       
    41 use "genrec.ML"
       
    42 use "typecheck.ML"
       
    43 use "eval.ML"
       
    44 
    34 end
    45 end