Changes between Version 49 and Version 50 of Supercompilation
- Timestamp:
- 11/09/09 22:28:17 (4 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Supercompilation
v49 v50 5 5 == Current Bugs == 6 6 7 * Naivrec: infinite recursion7 * Naivrec: Double runtime 8 8 9 9 * Boyer Moore: out of memory 10 10 11 * nbody: Assertion 11 * nbody: Assertion; evalPush 12 12 13 13 * boyer2: head: empty list; splitTerm 14 14 15 * Sieve2: run with argument 3. Wrong output.15 * Sieve2: infinite recursion (old: run with argument 3. Wrong output.) 16 16 17 17 == Open shortcomings == … … 74 74 * Validate with flag off; then push. 75 75 * Add IO monad; 76 * Write msg in the R form. Still with eager substitution77 76 * 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. 78 77 * Neil's msg idea … … 90 89 * Refined whistle-blowing test 91 90 * Write split in the R form. 91 * Write msg in the R form. Still with eager substitution 92 92 * add logging (one line per specialisation start, and completion) 93 93 * Use a record for the memo table contents
