Go backward to
Lazy and Eager Bindings
Go up to
Top
Go forward to
Typing Rules
Typing Rules
Basic Rules
pi
|-
newint
:
intloc exp
pi
|- E:
theta
pi
|-
lazy
I=E: { I:
theta
}
exp
pi
|- E:
tau
exp
pi
|-
eager
I=E: { I:
tau
}
exp
with
E
1
do
E
2
pi
|- E
1
:
pi
1
pi
-U-
pi
1
|- E
2
:
theta
pi
|-
with
E
1
do
E
2
:
theta
pi
|- E
1
:
pi
1
exp
pi
-U-
pi
1
|- E
2
:
tau
exp
pi
|-
with
E
1
do
E
2
:
tau
exp
tau
in {
pi
2
,
store
}
Second rule considers that evaluation of E
1
may cause side effects that must be managed by E
2
.
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: records.tex,v 1.1 1996/05/20 12:33:10 schreine Exp schreine