I dont know much about J, but if I'm understanding correctly, you have
an implementation of J in Typed Racket?
And then you want to be able to infer more specialized cases in some
instances by pruning the type?
You might be able to do it with just plain macros in that case, which
would generate
Thank you very much for taking the time to help me.
I am trying to write an extendable APL with full type inference and
optional type annotation. Essentially, I am trying to compile J. J cannot
be compiled efficiently because the ambiguities of its grammar lead to
combinatory explosion of
2 matches
Mail list logo