Sciweavers

1557 search results - page 81 / 312
» Programming up to Congruence
Sort
View
SAIG
2000
Springer
15 years 2 months ago
Fragmental Specialization
Traditional offline program specialization relies on staging of a computation into two levels, static and dynamic. We present a generalization thereof where the static input data o...
Simon Helsen, Peter Thiemann
AGP
1994
IEEE
15 years 2 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
ASPLOS
2012
ACM
13 years 7 months ago
Aikido: accelerating shared data dynamic analyses
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
Marek Olszewski, Qin Zhao, David Koh, Jason Ansel,...
FSTTCS
2009
Springer
15 years 5 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ICFP
2009
ACM
15 years 11 months ago
A functional I/O system or, fun for freshman kids
Functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10?14). After all, functional programming is a form of algebr...
Matthias Felleisen, Robert Bruce Findler, Matthew ...