Library model_validity_cbv

Additional structure for call-by-value models


Require Import model_structure.


Module sforces_cbv (ks : Kripke_structure).
  Export ks.
  Module ks_monad := (Kripke_structure_monad ks).
  Export ks_monad.

sforces is the strong forcing relation for call-by-value models
  Fixpoint sforces (w:K)(annot:bool)(A:formula) {struct A} : Type :=
    match A with
      | Atom a => X w annot (Atom a)
                    
      | Bot => X w annot Bot
                 
      | Func A1 A2 =>
        forall w', w <= w' ->
                   forall annot', leb annot annot' ->
                                  sforces w' annot' A1 -> Kont sforces w' annot' A2
                                                             
      | Sum A1 A2 => sum (sforces w annot A1) (sforces w annot A2)
    end.

Monotonicity properties of sforces

  Lemma sforces_mon : forall A w annot, sforces w annot A ->
                      forall w', w <= w' -> sforces w' annot A.

  Lemma sforces_mon2 : forall A w, sforces w false A -> sforces w true A.

This lemma can be proved, but it is not used for CBV
  Lemma Kont_sforces_mon2 : forall w annot A, Kont sforces w annot A ->
        forall annot', leb annot annot' -> Kont sforces w annot' A.

The "run" of the continuations monad
  Definition run {w annot} :
    Kont sforces w annot Bot -> X w annot Bot.
End sforces_cbv.

This page has been generated by coqdoc