Full abstraction * abstract-machine Compositional * black-box Game semantics.

34
  • date post

    22-Dec-2015
  • Category

    Documents

  • view

    232
  • download

    1

Transcript of Full abstraction * abstract-machine Compositional * black-box Game semantics.

Full abstraction * abstract-machine

Compositional * black-box

Game semantics

players

‘p’ makes Program moves

‘o’ makes Context moves

‘O’ goes first

moves

call

Return value

Write value

Acknowledge

[[Γ|

all plays:all sequences ofalternating observable moves that caNbe made between M (played by ‘P’)and any legal context (played by ‘O’)

–M:τ]]

[[Γ|–skip:com]]

[[Γ|–skip:com]]

[[Γ|–skip:com]]

[[Γ|–16:nat]]

[[Γ|–16:nat]]

[[Γ|–16:nat]]

–b:bool]][[Γ,b:bool |

–b:bool]][[Γ,b:bool |

–b:bool]][[Γ,b:bool |

–b:bool]][[Γ,b:bool |

–b:bool]][[Γ,b:bool |

–b:bool]][[Γ,b:bool |

–b:bool]][[Γ,b:bool |

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

19790306 JAM 13.7 Cook Freud Took Williams - Repetition!.mp3

[[Γ|–while: bool→com →com]]

[[Γ|–while: bool→com →com]]

@

composition

Interaction model

[[Γ,i:nat|–while i<16:com→com]]