Efficient loop detection in prolog using the tortoise-and-hare technique

DOI10.1016/0743-1066(87)90020-3zbMath0608.68006OpenAlexW2055093184WikidataQ56388150 ScholiaQ56388150MaRDI QIDQ3747702

Allen van Gelder

Publication date: 1987

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(87)90020-3

zbMATH Keywords

implementationloop detectiongoal reductionhigh- performance interpretersinfinite recursiontail-recursion optimizationtortoise-and-hare technique

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (8)

Contraction-free sequent calculi for intuitionistic logic ⋮ An analysis of loop checking mechanisms for logic programs ⋮ Generalizing completeness results for loop checks in logic programming ⋮ On the existence of nonterminating queries for a restricted class of PROLOG-clauses ⋮ Loop checks for logic programs with functions ⋮ Primal grammars and unification modulo a binary clause ⋮ Termination prediction for general logic programs ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals

This page was built for publication: Efficient loop detection in prolog using the tortoise-and-hare technique