1302 search results - page 156 / 261 » Free-Style Theorem Proving |
LPAR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
CSL
2003
Springer
14 years 3 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natu...
POPL
2000
ACM
14 years 2 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
ALP
1990
Springer
14 years 2 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...