Thomas Nordin

Learn More
Of late it has become very common for research compilers to emit C as their target code, relying on a C compiler to generate machine code. In eeect, C is being used as a portable compiler target language. It ooers a simple and eeective way of avoiding the need to re-implement eeective register allocation, instruction selection, and instruction scheduling,(More)
We describe a unified, lazy, declarative framework for solving constraint satisfaction problems, an important subclass of combinatorial search problems. These problems are both practically significant and hard. Finding good solutions involves combining good general-purpose search algorithms with problem-specific heuristics. Conventional imperative(More)
  • 1