797 search results - page 103 / 160 » Eliminating Proofs from Programs |
ESOP
2012
Springer
13 years 8 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
115
click to vote
ASPLOS
1998
ACM
15 years 5 months ago
1998
ACM
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...
102
Voted
CONCURRENCY
1998
15 years 12 days ago
1998
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
86
Voted
AOSD
2007
ACM
15 years 4 months ago
2007
ACM
Current implementations for aspect-oriented programming languages map the aspect-oriented concepts of source programs to object-oriented bytecode. This hinders execution environme...
114
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...