378 search results - page 60 / 76 » Automating Mathematical Program Transformations |
STOC
1999
ACM
13 years 11 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Despite the automated refactoring support provided by today's IDEs many program transformations that are easy to conceptualize-such as improving the implementation of a desig...
AINA
2008
IEEE
14 years 1 months ago
2008
IEEE
Process management and workflow systems play an important role in the composition of services in business as well as automation environments. Processes are designed using tools a...
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
Current day network processors incorporate several architectural features including symmetric multi-processing (SMP), block multi-threading, and multiple memory elements to suppor...
FLOPS
2004
Springer
14 years 24 days ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...