Hi, swipl 8.4.1 : (ins)?- A=call(A), call(A). ERROR: Stack limit (1.0Gb) exceeded ERROR: Stack sizes: local: 0.7Gb, global: 0.2Gb, trail: 0Kb ERROR: Stack depth: 10,735,430, last-call: 0%, Choice points: 3 ERROR: Probable infinite recursion (cycle): ERROR: [10,735,430] system:call(<compo…

Practically the example can be made run on most Prolog systems by replacing call/1 by Vanilla Interpreter solve/1. When I use this here: solve(X=X). solve(solve(A)) :- solve(A). solve((A,B)) :- solve(A), solve(B). I can run this query: ?- A=(1=1, solve(A)), solve(A). Indefinitely. The test res…

A=call(A), call(A). % can I get tail recursion?

Help!

brebs April 23, 2022, 10:04am 7

Seems relevant: Compiler support for cyclic terms? - #3 by jan

Topic		Replies	Views
Declarative predicates by limiting resources Help!	28	1989	August 31, 2019
Change in performance measures with non-tail recursion Nice to know	9	119	July 16, 2024
How to do tail recursion without growing the stack? Help!	2	1149	June 11, 2021
When are evaluable functions looked up? General	40	781	September 29, 2023
Prolog in Prolog revisited Resources prolog-in-prolog	7	682	January 15, 2020

A=call(A), call(A). % can I get tail recursion?

Related topics