(* This program is free software; you can redistribute it and/or      *)
(* modify it under the terms of the GNU Lesser General Public License *)
(* as published by the Free Software Foundation; either version 2.1   *)
(* of the License, or (at your option) any later version.             *)
(*                                                                    *)
(* This program is distributed in the hope that it will be useful,    *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of     *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the      *)
(* GNU General Public License for more details.                       *)
(*                                                                    *)
(* You should have received a copy of the GNU Lesser General Public   *)
(* License along with this program; if not, write to the Free         *)
(* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *)
(* 02110-1301 USA                                                     *)
(* MACHINE *)
(* Common descriptions for all abstract machines *)
Require Export fifo.
Require Export table.
Require Export reduce.
Require Export sigma2.
Unset Standard Proposition Elimination Names.
Section MACHINE.
Parameter Site : Set.
Parameter owner : Site.

(* Specifications: *)
Axiom eq_site_dec : eq_dec Site.
Definition change_site (E : Set) := change_x0 Site E eq_site_dec.
Lemma that_site :
forall (E : Set) (f : Site -> E) (s0 : Site) (x : E),
change_site E f s0 x s0 = x.
Lemma other_site :
forall (E : Set) (f : Site -> E) (s0 s1 : Site) (x : E),
s0 <> s1 -> change_site E f s0 x s1 = f s1.