297 search results - page 27 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
100
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
132
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
127
click to vote
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
ENTCS
2007
15 years 1 months ago
2007
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
132
click to vote
TABLEAUX
1995
Springer
15 years 4 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...