src/HOL/UNITY/Union.thy
author paulson
Wed, 08 Dec 1999 13:53:29 +0100
changeset 8055 bb15396278fb
parent 7947 b999c1ab9327
child 9685 6d123a7e30bd
permissions -rw-r--r--
abolition of localTo: instead "guarantees" has local vars as extra argument
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
5252
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     1
(*  Title:      HOL/UNITY/Union.thy
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     2
    ID:         $Id$
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     4
    Copyright   1998  University of Cambridge
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     5
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     6
Unions of programs
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     7
5804
8e0a4c4fd67b Revising the Client proof as suggested by Michel Charpentier. New lemmas
paulson
parents: 5648
diff changeset
     8
Partly from Misra's Chapter 5: Asynchronous Compositions of Programs
5252
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
     9
*)
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    10
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    11
Union = SubstAx + FP +
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    12
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    13
constdefs
5648
fe887910e32e specifications as sets of programs
paulson
parents: 5611
diff changeset
    14
  JOIN  :: ['a set, 'a => 'b program] => 'b program
6295
351b3c2b0d83 removed the infernal States, eqStates, compatible, etc.
paulson
parents: 6012
diff changeset
    15
    "JOIN I F == mk_program (INT i:I. Init (F i), UN i:I. Acts (F i))"
5252
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    16
5648
fe887910e32e specifications as sets of programs
paulson
parents: 5611
diff changeset
    17
  Join :: ['a program, 'a program] => 'a program      (infixl 65)
6295
351b3c2b0d83 removed the infernal States, eqStates, compatible, etc.
paulson
parents: 6012
diff changeset
    18
    "F Join G == mk_program (Init F Int Init G, Acts F Un Acts G)"
5252
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    19
6295
351b3c2b0d83 removed the infernal States, eqStates, compatible, etc.
paulson
parents: 6012
diff changeset
    20
  SKIP :: 'a program
351b3c2b0d83 removed the infernal States, eqStates, compatible, etc.
paulson
parents: 6012
diff changeset
    21
    "SKIP == mk_program (UNIV, {})"
5259
86d80749453f Null program and a few new results
paulson
parents: 5252
diff changeset
    22
5313
1861a564d7e2 Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents: 5259
diff changeset
    23
syntax
7359
98a2afab3f86 extra syntax for JN, making it more like UN
paulson
parents: 6295
diff changeset
    24
  "@JOIN1"     :: [pttrns, 'b set] => 'b set         ("(3JN _./ _)" 10)
5313
1861a564d7e2 Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents: 5259
diff changeset
    25
  "@JOIN"      :: [pttrn, 'a set, 'b set] => 'b set  ("(3JN _:_./ _)" 10)
1861a564d7e2 Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents: 5259
diff changeset
    26
1861a564d7e2 Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents: 5259
diff changeset
    27
translations
1861a564d7e2 Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents: 5259
diff changeset
    28
  "JN x:A. B"   == "JOIN A (%x. B)"
7359
98a2afab3f86 extra syntax for JN, making it more like UN
paulson
parents: 6295
diff changeset
    29
  "JN x y. B"   == "JN x. JN y. B"
98a2afab3f86 extra syntax for JN, making it more like UN
paulson
parents: 6295
diff changeset
    30
  "JN x. B"     == "JOIN UNIV (%x. B)"
5313
1861a564d7e2 Constrains, Stable, Invariant...more of the substitution axiom, but Union
paulson
parents: 5259
diff changeset
    31
5252
1b0f14d11142 Union primitives and examples
paulson
parents:
diff changeset
    32
end