🚀 go-pugleaf

Virtually every time someone posts Prolog code to the network I groan.
I see code like this:

>merge([],[],[]).
>merge([],List2,List2):- !, fail.
>merge(List1,[],List1):- !, fail.
>merge([Head1|Tail1],[Head2|Tail2],[Head1,Head2|R]):- merge(Tail1,Tail2,R), !.

I wince, I tear my hair out, I fall to my knees and bang my head
against the nearest rock crying; is this the Prolog code people write?
What happened to logic programming?  Am I wasting my time?

Then I compose myself.  I grit my teeth, take hold of my electronic
butchers knife and attack the code.  Out with the filth!  Out with the
cuts, the dirty negation, the asserts.  Wash it clean.  Just leave the
essence; pure beautiful logic:

merge([],[],[]).
merge(Head1.Tail1, Head2.Tail2, Head1.Head2.R) :-
	merge(Tail1,Tail2,R).

Then I look on it anew.  I see it can be run as Prolog.  No choice point
will be created!  It will be fast!  It can be run backwards!  It can be
run any way need dictates.  I breath a sigh of relief and my confidence
in logic programming and Prolog are restored.