Sciweavers

5415 search results - page 161 / 1083
» The Implementation of Functional Programming Languages
Sort
View
DATESO
2009
101views Database» more  DATESO 2009»
13 years 8 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
ICCL
1998
IEEE
14 years 2 months ago
Design and Implementation of Triveni: A Process-Algebraic API for Threads + Events
We describe Triveni, a framework and API for integrating threads and events. The design of Triveni is based on an algebra, including preemption combinators, of processes. Triveni ...
Christopher Colby, Lalita Jategaonkar Jagadeesan, ...
PLDI
2010
ACM
14 years 3 months ago
Green: a framework for supporting energy-conscious programming using controlled approximation
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeof...
Woongki Baek, Trishul M. Chilimbi
POPL
2009
ACM
14 years 11 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
FSTTCS
1999
Springer
14 years 2 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget