This is so cool.

@U055XFK8V seems like something you'd be interested in

Having a bit of trouble following what this project does. Could you please explain it?

Sure. It takes symbolic expressions representing primitive constructs in the lambda calculus + polymorphic let (or "Hindley-Milner" for short) and infers the types of them using the algorithm outlined in this paper https://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-031.pdf — Hindley-Milner is the same type system used by the ML family, a subset of the one used by Haskell, etc. — and basically the foundation of all type inference algorithms, if not most type systems

I had an interesting thought, not sure if this is possible, but could you use this sort of thing to add some static typing to clojure via clj-kondo?

specifically to enhance how it is used with malli https://github.com/metosin/malli#clj-kondo

Cool stuff! I have been working towards something along the lines of what @U051V5LLP proposes for a while, but there are tricky parts associated with Clojure's data structures being more expressive than typed collections. https://github.com/erp12/schema-inference

My build fails with Too many open files at clojure.tools.build.util.file$collect_files when using this version.

Thanks, I’ll take a look

@U06B8J0AJ would be great if you could test with 0.9.2!

All good! 👌