Re: Type inferencing code for CL

Pascal J. Bourguignon wrote:
> dc <david_creelman@[EMAIL PROTECTED]
> writes:
>
> >
> > ...without having to say what type j and k are from the lisp code, ie.
>
> Yes, that's called type inference.
>
> (defun infer-types (program)
>   (if (atom program)
>       (list (list :result (type-of program)))
>       (ecase (car program)
>          ((progn)
>               (loop
>                  :with var-types = nil
>                  :with result-type = nil
>                  :for form in (cdr program)
>                  :do (let ((types (infer-types form)))
>                        (setf result-type (assoc :result types)
>                              types (remove :result types :key (function
car)))
>                        (when types (setf var-types (nconc types
var-types))))
>                  :finally (return (cons result-type var-types))))
>          ((pasvar) nil)
>          ((setv) (list (list (cadr program) (type-of (caddr program)))
>                        (list :result (type-of (caddr program))))))))
>
> (infer-types '(progn (pasvar j)
>                      (setv j "hello")
>                      (pasvar k)
>                      (setv k 123)))
> -->
> ((:RESULT (INTEGER 0 16777215)) (K (INTEGER 0 16777215)) (J
(SIMPLE-BASE-STRING 5)))
>

Maybe now I can get rid of all those DECLARE forms in my code without
losing the speed. ;-)