Sciweavers

1559 search results - page 114 / 312
» Fundamentals of Generic Programming
Sort
View
MPC
2010
Springer
177views Mathematics» more  MPC 2010»
15 years 2 months ago
Adjoint Folds and Unfolds
Abstract. Folds and unfolds are at the heart of the algebra of programming. They allow the cognoscenti to derive and manipulate programs rigorously and effectively. Fundamental la...
Ralf Hinze
OOPSLA
2010
Springer
14 years 8 months ago
An input-centric paradigm for program dynamic optimizations
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
Kai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng She...
ESOP
2007
Springer
15 years 4 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
IFL
2005
Springer
15 years 3 months ago
Polytypic Syntax Tree Operations
Polytypic functional programming has the advantage that it can derive code for generic functions automatically. However, it is not clear whether it is useful for anything other tha...
Arjen van Weelden, Sjaak Smetsers, Rinus Plasmeije...
ISCA
2003
IEEE
88views Hardware» more  ISCA 2003»
15 years 3 months ago
Phase Tracking and Prediction
In a single second a modern processor can execute billions of instructions. Obtaining a bird’s eye view of the behavior of a program at these speeds can be a difficult task whe...
Timothy Sherwood, Suleyman Sair, Brad Calder