CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
CSL
2008
Springer
13 years 11 months ago
2008
Springer
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
The study of type isomorphisms for different -calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms o...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
CSL
2008
Springer
13 years 11 months ago
2008
Springer