Sciweavers

174 search results - page 26 / 35
» Efficient Intensional Implementation for Lazy Functional Lan...
Sort
View
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
ICC
2008
IEEE
139views Communications» more  ICC 2008»
14 years 2 months ago
Enabling Flexible Packet Filtering Through Dynamic Code Generation
— Despite its efficiency, the general approach of hardcoding protocol format descriptions in packet processing applications suffers from many limitations. Among the others, the l...
Olivier Morandi, Fulvio Risso, Mario Baldi, Andrea...
ICFP
2008
ACM
14 years 7 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
ECEASST
2006
96views more  ECEASST 2006»
13 years 7 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau
APLAS
2010
ACM
13 years 8 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann