4617 search results - page 539 / 924 » Automation of Diagrammatic Reasoning |
204
click to vote
LOPSTR
2007
Springer
16 years 1 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
182
click to vote
TPHOL
2006
IEEE
16 years 1 months ago
2006
IEEE
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of G¨odel’s T of type (N→N)→(N→N). The gen...
232
click to vote
FASE
2005
Springer
16 years 1 months ago
2005
Springer
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
187
click to vote
LOPSTR
2004
Springer
16 years 1 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
180
Voted
LPAR
2004
Springer
16 years 1 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...