521 search results - page 1 / 105 » Reduction Strategies and Acyclicity |
BIRTHDAY
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
ESA
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
NETWORKS
2008
13 years 4 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...