... | @@ -13,7 +13,6 @@ What next? **Implement the new algorithm.** |
... | @@ -13,7 +13,6 @@ What next? **Implement the new algorithm.** |
|
- Flag -fexpose-all-unfoldings (a cousin of -fomit-interface-pragmas) (default is off) to switch on the spit-out-all-unfoldings stuff.
|
|
- Flag -fexpose-all-unfoldings (a cousin of -fomit-interface-pragmas) (default is off) to switch on the spit-out-all-unfoldings stuff.
|
|
- Validate with flag off; then push.
|
|
- Validate with flag off; then push.
|
|
- Add IO monad; add logging (one line per specialisation start, and completion)
|
|
- Add IO monad; add logging (one line per specialisation start, and completion)
|
|
- Use a record for the memo table contents
|
|
|
|
- Write msg, split in the R form. Still with eager substitution
|
|
- Write msg, split in the R form. Still with eager substitution
|
|
- Figure out arity for each top-level (lambda lifted) function, and only inline when it is saturated. (Write notes in paper, explaining why this might be good.) NB: linearity becomes simpler, because a variable cannot occur under a lambda.
|
|
- Figure out arity for each top-level (lambda lifted) function, and only inline when it is saturated. (Write notes in paper, explaining why this might be good.) NB: linearity becomes simpler, because a variable cannot occur under a lambda.
|
|
- Refined whistle-blowing test
|
|
- Refined whistle-blowing test
|
... | @@ -32,6 +31,7 @@ Later |
... | @@ -32,6 +31,7 @@ Later |
|
|
|
|
|
Done
|
|
Done
|
|
|
|
|
|
|
|
- Use a record for the memo table contents
|
|
- State monad and good logging info; Stole SimplMonad.
|
|
- State monad and good logging info; Stole SimplMonad.
|
|
- Lambda lifting
|
|
- Lambda lifting
|
|
- Add the "loop-breaker" info to interface files (and read it back in).
|
|
- Add the "loop-breaker" info to interface files (and read it back in).
|
... | | ... | |