Go up to
Top
Go forward to
Typing Rules
Introduction
Records and lambda abstractions.
Crucial components of structured, parameterized language.
Basis of natural "model" and "logic".
The Desugared Programming Language
E in Everything
N in Numeral
L in Location
E ::= E
1
:=E
2
| E
1
;E
2
|
if
E
1
then
E
2
else
E
3
fi
|
skip
|
while
E
1
do
E
2
od
| E
1
+E
2
| E
1
=E
2
|
not
E | @E | N | L
Only one syntax rule
Typing annotations preserve structure:
Reasons for collapsing language:
Same structuring device for whole language instead of one instance for each syntax domain.
Additional language extensions more convenient.
Author:
Wolfgang Schreiner
Last Modification: May 14, 1998