🚀 go-pugleaf

In article <2733@swi.swi.psy.uva.nl> anjo@swi.psy.uva.nl () writes:
>Below is a definition of list_length/2 (length/2 in Edinburgh
>compatibles).  I would like to know whether there is a better/shorter
>solution
>list_length_non([], 0). 
>list_length_non([_|Xs], N) :-
>        list_length_non(Xs, M),
>        N is M+1.

This bit is not tail recursive and can easily be improved using an
accumulator (this is something you should always look out for):

list_length_non(Xs, N) :-
	list_length_non_ac(Xs, 0, N).

list_length_non_ac([], N, N).
list_length_non_ac([_|Xs], N0, N) :-
	N1 is N0 + 1,
	list_length_non_ac(Xs, N1, N).

	lee