Go backward to
Typing Rules Define a Language
Go up to
Top
Go forward to
Semantics of the Core Language
Proof Trees
Programs may be directly derived from typing rules.
Typing rules form a
logic
.
Set of axioms and inference rules.
(Inverted) trees are logic
proof trees
.
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: core.tex,v 1.3 1996/02/05 10:34:52 schreine Exp schreine