I implemented the Nimble type inference algorithm from Henry Baker's old Common Lisp paper in Clojure awhile back for . It's based on lattice/algebraic data flow (Kaplan-Ullman) rather than logical unification (Milner), and works well to calculate type specialization while compiling dynamic languages:

plover.com/misc/hbaker-archive

Yesterday I added a simple C generator to make something like Pre-Scheme <prescheme.org> for

A series of command line invocations showing type inference and compilation to C of a simple factorial program written in Clojure.
0

If you have a fediverse account, you can quote this note from your own instance. Search https://berlin.social/users/jack/statuses/116273315614370868 on your instance and quote it. (Note that quoting is not supported in Mastodon.)