1445 search results - page 108 / 289 » Uniformly Hard Languages |
154
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
160
click to vote
ENTCS
2007
15 years 6 months ago
2007
The engineering of systems that are acceptably correct is a hard problem. On the one hand, semi-formal modelling approaches that are used in practical, large-scale system developm...
179
click to vote
OOPSLA
2010
Springer
15 years 4 months ago
2010
Springer
Modern IDEs for object-oriented languages like Java provide support for a basic set of simple automated refactorings whose behaviour is easy to describe intuitively. It is, howeve...
177
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
DRAM is facing severe scalability challenges in sub-45nm technology nodes due to precise charge placement and sensing hurdles in deep-submicron geometries. Resistive memories, suc...
178
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...