1686 search results - page 90 / 338 » Programs as polygraphs: computability and complexity |
OOPSLA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
APPT
2003
Springer
15 years 3 months ago
2003
Springer
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
ACE
2004
14 years 11 months ago
2004
The issues surrounding curriculum design of many Computer Science and Software Engineering degree programs1 are many and complex. In particular, the question of whether prior prog...
LPNMR
1997
Springer
15 years 1 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
140
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...