4 (and (list? t) (eq? (car t) 'abs)))
7 (and (not (list? t)) (not (concrete? t)) (symbol? t)))
16 (define (pretty-type t)
20 (string-append "(" (pretty-type (cadr t)) ")")
21 (pretty-type (cadr t)))
23 (pretty-type (caddr t))))
24 (else (symbol->string t))))
27 (define (env-lookup env n)
28 (if (null? env) (error #f "empty env") ; it's a type equality
29 (if (eq? (caar env) n)
31 (env-lookup (cdr env) n))))
33 (define (env-insert env n t)
34 (cons (cons n t) env))
41 (set! cur-tvar (+ cur-tvar 1))
43 (string-append "t" (number->string (- cur-tvar 1))))))
50 (define (normalize prog) ; (+ a b) -> ((+ a) b)
53 ; (lambda (x y) (+ x y)) -> (lambda (x) (lambda (y) (+ x y)))
54 (if (> (length (lambda-args prog)) 1)
55 (list 'lambda (list (car (lambda-args prog)))
56 (normalize (list 'lambda (cdr (lambda-args prog)) (caddr prog))))
57 (list 'lambda (lambda-args prog) (normalize (caddr prog)))))
59 (if (null? (cddr prog))
60 `(,(normalize (car prog)) ,(normalize (cadr prog))) ; (f a)
61 (normalize `(,(list (normalize (car prog)) (normalize (cadr prog)))
62 ,@(cddr prog))))) ; (f a b)
65 (map (lambda (x) `(,(car x) ,(normalize (cadr x))))
67 (map normalize (let-body prog))))
68 (else (ast-traverse normalize prog))))
70 (define (builtin-type x)
72 ('+ '(abs int (abs int int)))
73 ('- '(abs int (abs int int)))
74 ('* '(abs int (abs int int)))
76 ('= '(abs int (abs int bool)))
77 ('bool->int '(abs bool int))
78 ('print '(abs string void))
81 ; we typecheck the lambda calculus only (only single arg lambdas)
82 (define (typecheck prog)
84 ;; (display "check: ")
92 ('int-literal (list '() 'int))
93 ('bool-literal (list '() 'bool))
94 ('string-literal (list '() 'string))
95 ('builtin (list '() (builtin-type x)))
98 (let* ((cond-type-res (check env (cadr x)))
99 (then-type-res (check env (caddr x)))
100 (else-type-res (check env (cadddr x)))
101 (then-eq-else-cs (~ (cadr then-type-res)
102 (cadr else-type-res)))
105 (consolidate (car else-type-res)
107 (return-type (substitute cs (cadr then-type-res))))
108 (when (not (eqv? (cadr cond-type-res) 'bool))
109 (error #f "if condition isn't bool"))
110 (list cs return-type)))
112 ('var (list '() (env-lookup env x)))
114 ; takes in the current environment and a scc
115 ; returns new environment with scc's types added in
116 (let* ([components (reverse (sccs (graph (let-bindings x))))]
120 ; create a new env with tvars for each component
122 ; scc-env = ((x . t0) (y . t1))
126 (env-insert acc c (fresh-tvar)))
128 ; typecheck each component
132 (let ([body (cadr (assoc c (let-bindings x)))])
133 (check scc-env body)))
135 ; collect all the constraints in the scc
141 (consolidate (car res)
142 ; unify with tvars from scc-env
144 (~ (cadr res) (env-lookup scc-env c)))))
145 '() type-results comps)]
146 ; substitute *only* the bindings in this scc
149 (if (memv (car x) comps)
150 (cons (car x) (substitute cs (cdr x)))
154 [new-env (fold-left process-component env components)])
155 (check new-env (last (let-body x)))))
158 (let* [(new-env (env-insert env (lambda-arg x) (fresh-tvar)))
160 (body-type-res (check new-env (lambda-body x)))
161 (cs (car body-type-res))
162 (subd-env (substitute-env (car body-type-res) new-env))
163 (arg-type (env-lookup subd-env (lambda-arg x)))
164 (resolved-arg-type (substitute cs arg-type))]
165 ;; (display "lambda:\n\t")
170 ;; (display resolved-arg-type)
172 (list (car body-type-res)
175 (cadr body-type-res)))))
178 (if (eqv? (car x) (cadr x))
179 ; recursive function (f f)
180 (let* [(func-type (env-lookup env (car x)))
181 (return-type (fresh-tvar))
182 (other-func-type `(abs ,func-type ,return-type))
183 (cs (~ func-type other-func-type))]
184 (list cs return-type))
187 (let* ((arg-type-res (check env (cadr x)))
188 (arg-type (cadr arg-type-res))
189 (func-type-res (check env (car x)))
190 (func-type (cadr func-type-res))
199 (consolidate func-c (car arg-type-res))
200 (car func-type-res)))
202 (resolved-func-type (substitute cs func-type))
203 (resolved-return-type (caddr resolved-func-type)))
204 ;; (display "app:\n")
207 ;; (display func-type)
209 ;; (display resolved-func-type)
211 ;; (display arg-type-res)
213 (if (abs? resolved-func-type)
214 (let ((return-type (substitute cs (caddr resolved-func-type))))
215 (list cs return-type))
216 (error #f "not a function"))))))))
217 ;; (display "result of ")
220 ;; (display (pretty-type (cadr res)))
222 ;; (display (car res))
225 (cadr (check '() (normalize prog))))
227 ; returns a list of pairs of constraints
229 (let ([res (unify? a b)])
233 (format "couldn't unify ~a ~~ ~a" a b)))))
236 (cond [(eq? a b) '()]
237 [(or (tvar? a) (tvar? b)) (list (list a b))]
238 [(and (abs? a) (abs? b))
239 (let* [(arg-cs (unify? (cadr a) (cadr b)))
240 (body-cs (unify? (substitute arg-cs (caddr a))
241 (substitute arg-cs (caddr b))))]
242 (consolidate arg-cs body-cs))]
245 ; TODO: what's the most appropriate substitution?
246 ; should all constraints just be limited to a pair?
247 (define (substitute cs t)
248 ; gets the first concrete type
249 ; otherwise returns the last type variable
253 (filter (lambda (x) (not (eqv? t x))) c))
256 (define (get-concrete c)
257 (let [(last (null? (cdr c)))]
258 (if (not (tvar? (car c)))
260 (substitute cs-without-t (car c))
264 (get-concrete (cdr c))))))
268 (substitute cs (cadr t))
269 (substitute cs (caddr t))))
278 (define (substitute-env cs env)
279 (map (lambda (x) (cons (car x) (substitute cs (cdr x)))) env))
281 (define (consolidate x y)
285 (else (if (member (car b) a)
287 (cons (car b) (merge a (cdr b)))))))
288 (define (overlap? a b)
289 (if (or (null? a) (null? b))
291 (if (fold-left (lambda (acc v)
292 (or acc (eq? v (car a))))
295 (overlap? (cdr a) b))))
310 (filter (lambda (b) (not (eq? b (cdr merged)))) x)
313 (consolidate removed (cons (car merged) (cdr y)))
314 (consolidate (cons a x) (cdr y)))))))
316 ; a1 -> a2 ~ a3 -> a4;
317 ; a1 -> a2 !~ bool -> bool
318 ; basically can the tvars be renamed
319 (define (types-equal? x y)
320 (let ([cs (unify? x y)])
325 (if (tvar? c) acc #f))]
326 [test (lambda (acc c)
327 (and acc (fold-left test-kind #t c)))])
328 (fold-left test #t cs)))))
330 ; input: a list of binds ((x . y) (y . 3))
331 ; returns: pair of verts, edges ((x y) . (x . y))
333 (define (find-refs prog)
337 ; only count a reference if its a binding
338 ['var (if (assoc x bs) (list x) '())]
343 (let* [(bind (car bs))
346 (refs (find-refs (cdr bind)))
347 (edges (map (lambda (x) (cons vert x))
350 (rest (if (null? (cdr bs))
353 (total-verts (cons vert (car rest)))
354 (total-edges (append edges (cdr rest)))]
355 (cons total-verts total-edges))))
357 (define (successors graph v)
361 (if (eqv? v (caar E))
362 (cons (cdar E) (go v (cdr E)))
366 ; takes in a graph (pair of vertices, edges)
367 ; returns a list of strongly connected components
369 ; ((x y w) . ((x . y) (x . w) (w . x))
379 ; this uses tarjan's algorithm, to get reverse
380 ; topological sorting for free
383 (let* ([indices (make-hash-table)]
384 [lowlinks (make-hash-table)]
385 [on-stack (make-hash-table)]
391 (get-hash-table indices v #f))
393 (get-hash-table lowlinks v #f))
399 (put-hash-table! indices v current)
400 (put-hash-table! lowlinks v current)
401 (set! current (+ current 1))
403 (put-hash-table! on-stack v #t)
407 (if (not (hashtable-contains? indices w))
408 ; successor w has not been visited, recurse
411 (put-hash-table! lowlinks
413 (min (lowlink v) (lowlink w))))
414 ; successor w has been visited
415 (when (get-hash-table on-stack w #f)
416 (put-hash-table! lowlinks v (min (lowlink v) (index w))))))
417 (successors graph v))
419 (when (= (index v) (lowlink v))
422 (let ([w (pop! stack)])
423 (put-hash-table! on-stack w #f)
426 (cons w (new-scc)))))])
427 (set! result (cons scc result))))))])
430 (when (not (hashtable-contains? indices v)) ; v.index == -1