479 search results - page 85 / 96 » The theory and calculus of aliasing |
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
PPDP
2004
Springer
14 years 1 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
IRI
2003
IEEE
14 years 1 months ago
2003
IEEE
– Building large software systems out of existing software components can save time and cost. These software components range from architectural and design components to binary c...
ICALP
2010
Springer
14 years 16 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
FOCS
1998
IEEE
14 years 17 hour 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...