[Prolog related] [Prolog systems] iso-prolog [others]
Debugger free debugging, understanding non-termination using a failure-slice. Failure slices provide a lower bound for the number of inferences. E.g. the largest integer or factors.
The Prolog prologue attempts to make Prolog systems more uniform. Help put the dcg formalism on a normative basis! Use SO for factual questions around.
Features of good Prolog code. How to identify redundant answers.
?- maplist(dif(X),Xs).
Xs = []
; Xs = [_A], dif(X,_A)
; Xs = [_A,_B], dif(X,_A), dif(X,_B)
; Xs = [_A,_B,_C], dif(X,_A), dif(X,_B), dif(X,_C)
; ... .
Whose mind is not touched by such pure beauty? More:
if_/3
,
(=)/3
,
list_t/2
,
memberd_t/3
,
tfilter/3
,
tmember/2
,
(',')/3
,
maplist/2,3,4…
,
closure/3
,
closure0/3
,
path/4
,
λ
,
iso_dif/2
,
memberd/2
,
non_member/2
,
all//1
,
all_seq//2
,
iwhen/2
,
call_nub/1
,
call_semidet/1
,
call_nth/2
.
You have more?
Prolog tags. Still here? So I can tell you: my handle is vocative. Thus [fal.sɛ] and neither [fɔlls] nor [fɒls]
..........................................................................................................