Author of the publication

Termination Analysis with Types Is More Accurate.

, , and . ICLP, volume 2916 of Lecture Notes in Computer Science, page 254-268. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

CLP(chi) for Proving Program Properties., , and . FroCoS, volume 3 of Applied Logic Series, page 321-338. Kluwer Academic Publishers, (1996)Approximations entre langages de programmation logique avec contraintes.. JFPL, page 319-341. TEKNEA, (1993)Slicing zur Fehlersuche in Logikprogrammen., , and . WLP, volume 90 of GMD Report, page 241-243. (2000)Computing Convex Hulls with a Linear Solver, , and . CoRR, (2003)Recurrence with affine level mappings is P-time decidable for CLP(R)., and . Theory Pract. Log. Program., 8 (1): 111-119 (2008)cTI: A constraint-based termination inference tool for ISO-Prolog., and . Theory Pract. Log. Program., 5 (1-2): 243-257 (2005)Contrôle dynamique de la résolution pour les programmes logiques avec contraintes., and . JFPLC, page 259-273. (1995)Recurrence with affine level mappings is P-time decidable for CLP(R), and . CoRR, (2007)Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices., and . PPDP, volume 1702 of Lecture Notes in Computer Science, page 328-342. Springer, (1999)Termination Analysis with Types Is More Accurate., , and . ICLP, volume 2916 of Lecture Notes in Computer Science, page 254-268. Springer, (2003)