Sciweavers

1989 search results - page 61 / 398
» Set functions for functional logic programming
Sort
View
TAPSOFT
1997
Springer
14 years 2 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
GPEM
2006
89views more  GPEM 2006»
13 years 10 months ago
Morphological algorithm design for binary images using genetic programming
This paper presents a Genetic Programming (GP) approach to the design of Mathematical Morphology (MM) algorithms for binary images. The algorithms are constructed using logic opera...
Marcos I. Quintana, Riccardo Poli, Ela Claridge
ICML
1989
IEEE
14 years 2 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
JLP
2007
114views more  JLP 2007»
13 years 10 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
DAGSTUHL
2004
13 years 11 months ago
Testing with Functions as Specifications
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...
Pieter W. M. Koopman