4940 search results - page 587 / 988 » On the Complexity of Universal Programs |
165
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
181
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
Instead of writing SQL queries directly, programmers often prefer writing all their code in a general purpose programming language like Java and having their programs be automatica...
188
Voted
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
171
Voted
HPDC
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper presents the concept of pluggable parallelisation that allows scientists to develop “sequential like” codes that can take advantage of multi-core, cluster and grid ...
171
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordinat...