Lecture #14, Feb. 28, 2007.ppt

Lecture #14, Feb. 28, 2007 Type Checkers in ML To build type-checkers in ML we need A datatype to represent types A datatype (or datatypes) to represent programs (whose type we are checking) Expressions Statements Declarations A means for computing equality over types A means for expressing type errors We build type checkers as attribute computations We need to think ahead. An attribute computation for each datatype representing programs What are the inherited and synthesized attributes for each datatype What will the type of the functions that implement each attribute computation. Will we simply compute a type, or will we decorate the syntax tree? The role of type rules Type rules play an important role. They are short and concise They are used as a communication mechanism. S |- x : a S |- f : a - t S |- f x : t Normally, the context is an inherited attribute, and the result is a synthesized attribute Representing Types datatype MLtype = Unit | Int | Char | Bool | Product of MLtype list | Arrow of (MLtype * MLtype); Representing Programs 1 datatype Op = Plus | Less | And datatype Constant = Cint of int (* 5 *) | Cchar of char (* #”z” *) | Cbool of bool (* true *) and Dec = Valdec of string*Exp (* let val x = 5 in x end *) | Fundec of string*string*MLtype*Exp (* let fun f (x:int) = x + 1 in f end *) Representing Programs 2 datatype Exp = Lit of Constant (* 5 *) | Var of string (* x *) | App of Exp*Exp (* f x *) | Tuple of Exp list (* (x,3,true) *) | Infix of Exp*Op*Exp (* x+3 *) | Stmt of Exp list (* (print x; 3) *) | If of Exp * Exp * Exp (* if x then y else 3 *) | While of Exp * Exp (* while x do (f x) *) | Anonfun of string * MLtype * Exp (* (fn x = x+1) *) | Let of Dec*Exp (* let val x = 1 in x end *) Type Equality fun typeeq (x,y) = case