Go backward to Examples
Go up to Top
Go forward to Semantic Algebras
Examples
- [[ (X:=1; while X>0 do Y:=Y+1) || X
:=0 ]]
- X:=0; X:=1; test X>0; Y:=Y+1; test X>0; Y:=Y+1; ...
- X:=1; X:=0; test X>0
- X:=1; test X>0; X:=0; Y:=Y+1; test X>0.
- X:=1; test X>0; Y:=Y+1; X:=0; test X>0.
- X:=1; test X>0; Y:=Y+1; test X>0; X:=0; Y:=Y+1; test X>0.
- ...
- [[ X:=0 ]] eventually occurs.
- Evaluation sequence is then called fair.
- In unfair sequence, [[ X:=0 ]] never occurs.
- Resumption semantics models both fair and unfair sequences.
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: intro.tex,v 1.2 1996/01/31 15:37:03 schreine Exp schreine