... | ... | @@ -62,8 +62,7 @@ Shortcomings of the prototype: |
|
|
What next? **Implement the new algorithm.**
|
|
|
|
|
|
- Write drive, msg, split in the R form. Still with eager substitution
|
|
|
- Export unfoldings for recursive functions. Remember to add the "loop-breaker" info to interface files (and read it back in).
|
|
|
- Lambda lifting
|
|
|
- Export unfoldings for recursive functions.
|
|
|
- Refined whistle-blowing test
|
|
|
- Neil's msg idea
|
|
|
- State monad and good logging info
|
... | ... | @@ -77,6 +76,12 @@ Later |
|
|
- Post-pass to undo redundant specialisation??
|
|
|
- Neil does "evaluation" before specialising, to expose more values to let, and maybe make lets into linear lets. We don't. Yet.
|
|
|
|
|
|
|
|
|
Done
|
|
|
|
|
|
- Lambda lifting
|
|
|
- Add the "loop-breaker" info to interface files (and read it back in).
|
|
|
|
|
|
## Open questions
|
|
|
|
|
|
- Should R contexts include let-statements? Need to worry about name capture even more then.
|
... | ... | |