Did you know ... Search Documentation:
Predicate maplist/4
Availability::- use_module(library(apply)).(can be autoloaded)
Sourcemaplist(:Goal, ?List1)
maplist(:Goal, ?List1, ?List2)
maplist(:Goal, ?List1, ?List2, ?List3)
maplist(:Goal, ?List1, ?List2, ?List3, ?List4)
True if Goal is successfully applied on all matching elements of the list. The maplist family of predicates is defined as: 
maplist(G, [X_11, ..., X_1n],
           [X_21, ..., X_2n],
           ...,
           [X_m1, ..., X_mn]) :-
   call(G, X_11, ..., X_m1),
   call(G, X_12, ..., X_m2),
   ...
   call(G, X_1n, ..., X_mn).

This family of predicates is deterministic iff Goal is deterministic and List1 is a proper list, i.e., a list that ends in [].

Examples

Apply predicate to each element in a list

Apply predicate to each element in a list

?- maplist(plus(3), [1, X], [Y, 2]).
X = -1,
Y = 4.
Generate solutions

Generate solutions

?- length(L, 3), maplist(between(0, 1), L).
L = [0, 0, 0] ;
L = [0, 0, 1] ;
L = [0, 1, 0] ;
L = [0, 1, 1] ;
L = [1, 0, 0] ;
L = [1, 0, 1] ;
L = [1, 1, 0] ;
L = [1, 1, 1].
Fill a list

Fill a list

?- length(L, 5), maplist(=(foo), L).
L = [foo, foo, foo, foo, foo].
Test for atoms

Test for atoms

?- maplist(atom, [a, b, c]).
true.

?- maplist(atom, [a, 2, c]).
false.
Test for integers in a range

Test for integers in a range

?- maplist(between(1, 3), [1, 2, 3]).
true.

?- maplist(between(1, 3), [1, 2, 99]).
false.
Counting word frequency

Counting word frequency

word_frequency_count(Words, Counts) :-
    maplist(downcase_atom, Words, LwrWords),
    msort(LwrWords, Sorted),
    clumped(Sorted, Counts).
?- word_frequency_count([a,b,'A',c,d,'B',b,e], Counts).
Counts = [a-2, b-3, c-1, d-1, e-1].
See also
- tokenize_atom/2 or split_string/4 may be used to split a text into tokens
Tag confusing pages with doc-needs-help|Tags are associated to your profile if you are logged in
Tags:
LogicalCaptain said (2020-04-14T15:36:40):0 upvotes 0 0 downvotes
Picture of user LogicalCaptain.

All three lists must be the same length (or at least, must be able to be the same length eventually) -- otherwise the predicate fails.

It makes sense from a logical point of view.

This is quite unlike in Clojure for example, where a map operation on several lists ends when one of the lists runs out.

Maybe a maplist/4 that stops as soon as the end of any list is reached (called prefix_maplist/4 maybe) might be considered as shortening or extending lists at their end is expensive.

Here is a maplist/4 example and a fun exercise to implement foldl/4 with maplist/4

Examples for the Prolog predicate maplist/4