8766 search results - page 217 / 1754 » Functional logic programming |
LOPSTR
2004
Springer
15 years 4 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
WLP
1997
Springer
15 years 2 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
103
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
SAS
2001
Springer
15 years 3 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
VL
1993
IEEE
15 years 2 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...