Possible optimizations in the compiler

• Control what kind of object files (dbg, opt, prof) are linked
  • use gcc lib as standard (is optimized O4)

• F(id,\ H(x) -> G(x,x) \, id) is equivalent to \ F(a, H(x), b) -> F(a, G(x,x), b)
• Do needed definition analysis as early as possible

• set up benchmarks and reggression tests
  • propositional formulae
  • sieve
  • note: the compiler itself is of course the real regression test although it does not cover all aspects/constructs of the language

• Make a set of benchmarks that can function as reference for optimizations

• What is the overhead caused by the assert statements in the run-time system?

• Do effects analysis on strategy expressions; distinghuish the following effects: no effect, transformation effect, variable binding effect, failure effect

• optimizations
  • stack access should be done via hard pointers instead of indices, i.e., now: choice_stack[csp], should be: csp is pointer to choice_stack[csp];
  • do matchings on symbols instead of strings

• Also inline sums of rules if they occur inside a sum

• Generate congruence definition by need in the same style as threading and distributing congruences.

-- EelcoVisser - 08 Dec 2001