& Inference

Type Derivation
Type Derivations
•

Type Judgement : ¥É~ , where f: environment /

mapping ( { x :O , . . .
}) ; 1- : entails ; exp program expression ;
: 7 :
type of exp

R Pz - - -
Pn
Type checking conclusion C holds if premises Pr
•

: C , where . . . .
.
Pn all hold

Axioms

no no premise →
unconditionally true
1) Constant Axioms : •

Integer constants : Tt n : int

,
assuming n is an integer constant

•
Boolean Constants : F 1- true : boot and I 1- false boot :

2) Variable Axiom : •
Variable References → ¥0 if FCX ) = 6 ( a reference to var ✗ has
type 6 if ✗ has
type 6 in the environment )

Rules

ft " " "" "" " i"

1) Arithmetic Operators ( ② c- { + ,
-

,
*
,
- }) :
T te, ① ez : int ( e. ⑤ ez has type int if e, has type int & ez has type int )

assume int
Fte , :X Ttez : it
2) Relational Operators In c- { <, >
,
=
, .. .
}) :
r te , uez : bool ( ein ez has type boot if e, has type int & ez has type int )

ft el :b001 ft ez :b001
3) Logical Connectives ( NN C- {andalso , orelse}) :
ri -
e, un ez : boot
(e ,
n ~ ez has type boot if e, has type boot & ez has type boot)

must be the same

Fte : boot Ttez : Tr+ez:÷
4) If then else
- - :
ft if e , then ez else e3

ft { ✗ Tx } : t e : Te
5) Anonymous Functions :
rtfn ✗ e : ex → Te
- function - argument
T te, : Tz → T Tt ez Tz :

6) Function Application :
ft e. ez : 7

Ttei % ft { x :P, } 1- ez : K
7)
:

Let Val :

T 1- let Val ✗ = e, in ez end : 72

[+ {f Tx → % X: Tx } ten :X, ft { f Tx : → Ya } 1- ez : Tz
8) Let fun
:
,
:

f 1- let fun f- ✗ = e, in ez end : Ya

Type Inference

Unification Algorithm for 5={6--1-1} u s

'

•
Delete : if Unify Is)
'

s = = t → =
Unify IS )
•

Decompose if f- Iq & t f- Ira rm) Unify 1st Unity ( { 19 rml} us )

'
S
gm) Cqm
:
=
, , . . -
,
=
, . . -
, →
=
,
= r )
, , . . -
, =

Orient : if
'
&
t is variable variable
Unify G) Unify({ (✗ s) } us )
•
a ✗ s is not a
→ = =

• Eliminate if: s is a variable ✗ & ✗ does not occur in t →

1) Let D= { ✗ → t } ( substitution for all ✗ with t )

2) Let Y= Unity 1415 '

) ) ( substitute all ✗ in
'
S with t )

3) Unity IS) = Yo {✗→t}