Sciweavers

4573 search results - page 521 / 915
» Automated Reasoning
Sort
View
TPHOL
2006
IEEE
15 years 11 months ago
Minlog
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...
Helmut Schwichtenberg
LOPSTR
2004
Springer
15 years 10 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
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 ...
J. B. Wells, Boris Yakobowski
LPAR
2004
Springer
15 years 10 months ago
Second-Order Matching via Explicit Substitutions
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Flávio L. C. de Moura, Fairouz Kamareddine,...
TPHOL
2003
IEEE
15 years 10 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
138
Voted
FIW
2007
120views Communications» more  FIW 2007»
15 years 6 months ago
Problem-Oriented Feature Interaction Detection in Software Product Lines
Feature interaction detection in the context of systems that are highly integrated into their environment, such as embedded or software-intensive systems, is different from classi...
Andreas Classen