145 search results - page 1 / 29 » A compiled implementation of strong reduction |
ICFP
2002
ACM
14 years 4 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
ESOP
1994
Springer
13 years 8 months ago
1994
Springer
Functional language compilers implement only weak-head reduction. However, there are cases where head normal forms or full normal forms are needed. Here, we study how to use cps c...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
This paper presents the design and implementation of a compiler algorithm that effectively optimizes programs for energy usage using dynamic voltage scaling (DVS). The algorithm ...
APCSAC
2003
IEEE
13 years 10 months ago
2003
IEEE
The StrongARM processor features virtually-addressed caches and a TLB without address-space tags. A naive implementation therefore requires flushing of all CPU caches and the TLB ...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...