3454 search results - page 610 / 691 » Modern computer algebra |
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
PDP
2010
IEEE
14 years 4 months ago
2010
IEEE
—Multicore nodes have become ubiquitous in just a few years. At the same time, writing portable parallel software for multicore nodes is extremely challenging. Widely available p...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
ACSC
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we examine the composition of firstclass protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agent...