j
k
j a
j l
which cannot be prohibited statically if we want both the language to be Turing complete, and type inference to be decidable.
Could you be so kind as to give a hint on literature that could help me understand this statement?
Attachments:
Back to the thread
Back to the list