🚀 go-pugleaf

I have edited both max-versions for better comparability:

max_heiner( [Max], Max ) :- !.
max_heiner( [MaxSoFar, First |Rest], Max ) :-
	MaxSoFar > First, !, 
	max_heiner( [MaxSoFar |Rest], Max ).
max_heiner( [_|Rest], Max ) :-
	max_heiner( Rest, Max ).


max_hamer( [First |Rest], Max ) :-
	max_hamer( First, Rest, Max ).

max_hamer( Max, [], Max ) :- !.
max_hamer( MaxSoFar, [First |Rest], Max ) :-
	MaxSoFar > First, !, 
	max_hamer( MaxSoFar, Rest, Max ).
max_hamer( _, [First |Rest], Max ) :-
	max_hamer( First, Rest, Max ).


The difference seems to be almost of a syntactic character. Hamer 
uses a temporary variable for the greatest element seen so far 
whereas Heiner uses the first element of the input list for that 
purpose. 

I think it's bad style to misuse the input for constructing
the result instead of applying the standard accumulator pair technique.

Heiner's solution needs heap space for storing the intermediate 
result making it 30 % slower.