54 search results - page 1 / 11 » Non-termination Inference for Constraint Logic Programs |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
SAS
2004
Springer
13 years 10 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
PPCP
1993
13 years 8 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
POPL
2011
ACM
12 years 7 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...