Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, Doug...
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
: Whereas sophisticated computer users can exercise more control in what they are exposed to and produce computational artifacts, technologically challenged end-users assume a more...
— This paper describes a research experiment carried out at the University of Catania, aiming at testing and evaluating the applicability of the Erlang language in programming mu...