Sciweavers

882 search results - page 150 / 177
» A Taste of Rewrite Systems
Sort
View
117
Voted
ENTCS
2007
101views more  ENTCS 2007»
15 years 13 days ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...
97
Voted
SCP
2010
148views more  SCP 2010»
14 years 11 months ago
Debugging hygienic macros
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
Ryan Culpepper, Matthias Felleisen
88
Voted
CASES
2010
ACM
14 years 10 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
DSL
2009
14 years 10 months ago
Operator Language: A Program Generation Framework for Fast Kernels
Abstract. We present the Operator Language (OL), a framework to automatically generate fast numerical kernels. OL provides the structure to extend the program generation system Spi...
Franz Franchetti, Frédéric de Mesmay...
97
Voted
OSDI
1996
ACM
15 years 1 months ago
Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications
Current operating systems offer poor performance when a numeric application's working set does not fit in main memory. As a result, programmers who wish to solve "out-of...
Todd C. Mowry, Angela K. Demke, Orran Krieger