Home

sebfisch edited this page Sep 13, 2010 · 17 revisions
Clone this wiki locally

Todo

strategies

  • eager/unique choices
  • priority queue with context as priority
  • breadth first search

code coverage

  • coverage store as strategy transformer
  • search based on coverage

refactoring

higher order

  • conversion of non-deterministic functions to primitive functions (committed choice?)

implement constraint solvers

SAT solver, Integer Interval solver

unbound variables

implement unification by storing a mapping of ID’s that are used for renarrowing

compiler

  • Core Haskell (GHC/YHC?) → CFLP
  • Flat Curry → Core Haskell/CFLP?

parallelise

  • use dph to compute normal forms.
  • provide parallel pattern matching?