1631 search results - page 73 / 327 » Extreme Programming - Back to Basics |
92
Voted
ICALP
1990
Springer
15 years 6 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
104
click to vote
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
105
Voted
POS
2000
Springer
15 years 6 months ago
2000
Springer
Orthogonal persistence opens up the possibility for a number of applications. We present an approach for easily enabling transparent orthogonal persistence, basically on top of a m...
86
Voted
MSCS
2008
15 years 2 months ago
2008
We model micro-architectures with non-pipelined instruction processing and pipelined instruction processing, using Maurer machines, basic thread algebra and program algebra. We sho...
105
Voted
ICFP
2004
ACM
16 years 2 months ago
2004
ACM
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...