1070 search results - page 81 / 214 » Type Classes with Functional Dependencies |
PLDI
2011
ACM
12 years 12 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
VISUALIZATION
1992
IEEE
14 years 1 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
JCT
2010
13 years 7 months ago
2010
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
SIROCCO
2008
13 years 10 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...