14 search results - page 3 / 3 » On Terminating Lemma Speculations |
ITP
2010
13 years 10 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
ICLP
1997
Springer
13 years 10 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
DBPL
1999
Springer
13 years 10 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
CPP
2011
12 years 6 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...