Glitch works this way. It will simply redo the tree when better data is available (via dependency tracing); so you can parse, type check various parts within and between files using what is essentially optimistic parallelism.
This is quite useful for non regular problems that are otherwise difficult to parallelize.
This is quite useful for non regular problems that are otherwise difficult to parallelize.