/usr/share/hol88-2.02.19940316/contrib/CSP/traces.ml is in hol88-contrib-source 2.02.19940316-19.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 | % Builds Up A Basic Theory For TRACES In CSP %
% %
% FILE : traces.ml %
% DESCRIPTION : Defines TRACES as lists of EVENTS where, for the time %
% being, EVENTS are represented by the type *. %
% The theory consists of definitions and theorems %
% regarding the following operators on TRACES: %
% distributive, strict, iterate, restrict, *, and <=. %
% %
% READS FILES : list_lib1.th %
% WRITES FILES : traces.th %
% %
% AUTHOR : Albert J Camilleri %
% AFFILIATION : Hewlett-Packard Laboratories, Bristol %
% DATE : 89.02.03 %
% MODIFIED : 89.07.19 %
% REVISED : 91.10.01 %
new_theory `traces`;;
new_parent `list_lib1`;;
map (load_theorem `list_lib1`) [`APPEND_ID`; `APPEND_NIL`];;
let trace = ":* list";;
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% STRICT PREDICATE %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
let TR_STRICT =
new_definition
(`TR_STRICT`, "TR_STRICT (f:^trace->^trace) = (f [] = [])");;
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% DISTRIBUTIVE PREDICATE %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
let TR_DIST =
new_definition
(`TR_DIST`,
"TR_DIST (f:^trace->^trace) =
! s t:^trace. (f (APPEND s t) = (APPEND (f s) (f t)))");;
% THEOREM: All distributive functions on traces are strict. %
let TR_DIST_STRICT =
prove_thm
(`TR_DIST_STRICT`,
"! f:^trace->^trace. (TR_DIST f) ==> (TR_STRICT f)",
REWRITE_TAC [TR_STRICT; TR_DIST] THEN
REPEAT STRIP_TAC THEN
IMP_RES_TAC thm)
where thm =
(REWRITE_RULE
[APPEND; APPEND_ID]
(DISCH_ALL
(SPECL ["[]:^trace";"[]:^trace"]
(ASSUME "(!s t:^trace. (f(APPEND s t):^trace) =
APPEND(f s)(f t))"))));;
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% ITERATION %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
let ITERATE =
new_prim_rec_definition
(`ITERATE`,
"(ITERATE 0 (t:^trace) = []) /\
(ITERATE (SUC n) t = APPEND t (ITERATE n t))");;
let ITER_COMM =
prove_thm
(`ITER_COMM`,
"! n:num (t:^trace). ITERATE (SUC n) t = APPEND (ITERATE n t) t",
INDUCT_TAC THENL
[REWRITE_TAC[ITERATE;APPEND;APPEND_NIL];
GEN_TAC THEN
SUBST1_TAC (SPEC_ALL (CONJUNCT2 ITERATE)) THEN
REWRITE_TAC[SPEC "SUC n" (CONJUNCT2 ITERATE)] THEN
ASM_REWRITE_TAC[APPEND_ASSOC]]);;
let ITER_APP =
prove_thm
(`ITER_APP`,
"! n:num (s t:^trace).
ITERATE (SUC n) (APPEND s t) =
APPEND s (APPEND (ITERATE n (APPEND t s)) t)",
INDUCT_TAC THENL
[REWRITE_TAC[ITERATE;APPEND;APPEND_NIL];
REWRITE_TAC[SPEC "SUC n" (CONJUNCT2 ITERATE)] THEN
ASM_REWRITE_TAC[] THEN
REWRITE_TAC[thm; SYM (SPEC_ALL (CONJUNCT2 ITERATE))] THEN
ASM_REWRITE_TAC[]])
where
thm =
prove ("!a b c d e:(*)list.
APPEND (APPEND a b) (APPEND c (APPEND d e)) =
(APPEND a (APPEND (APPEND (APPEND b c) d) e))",
REWRITE_TAC[APPEND_ASSOC]);;
close_theory();;
|