1204 search results - page 78 / 241 » Termination of Polynomial Programs |
114
Voted
JAPLL
2007
15 years 3 months ago
2007
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
155
Voted
CORR
2010
Springer
15 years 29 days ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
121
click to vote
PPPJ
2009
ACM
15 years 10 months ago
2009
ACM
In test-driven development, tests are written for each program unit before the code is written, ensuring that the code has a comprehensive unit testing harness. Unfortunately, uni...
104
Voted
ENTCS
2008
15 years 3 months ago
2008
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
149
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...