mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-22 04:43:53 +00:00
81c898956b
Estimated hours taken: 0.25 tests/hard_coded/higher_order_syntax.m: tests/hard_coded/higher_order_func_test.m: Delete nondet/multi modes of the function `map_f', since nondeterministic functions are not allowed.
50 lines
1.3 KiB
Mathematica
50 lines
1.3 KiB
Mathematica
:- module higher_order_syntax.
|
|
:- import_module int.
|
|
|
|
:- interface.
|
|
:- import_module std_util, list, io.
|
|
|
|
:- pred main(io__state::di, io__state::uo) is det.
|
|
|
|
:- func map_f(func(X) = Y, list(X)) = list(Y).
|
|
:- mode map_f(func(in) = out is det, in) = out is det.
|
|
:- mode map_f(func(in) = out is semidet, in) = out is semidet.
|
|
|
|
:- pred map_p(pred(X, Y), list(X), list(Y)).
|
|
:- mode map_p(pred(in, out) is det, in, out) is det.
|
|
:- mode map_p(pred(in, out) is semidet, in, out) is semidet.
|
|
:- mode map_p(pred(in, out) is multi, in, out) is multi.
|
|
:- mode map_p(pred(in, out) is nondet, in, out) is nondet.
|
|
|
|
:- implementation.
|
|
|
|
map_f(_, []) = [].
|
|
map_f(F, [H0|T0]) = [F(H0) | map_f(F, T0)].
|
|
|
|
map_p(_, [], []).
|
|
map_p(P, [X|Xs], [Y|Ys]) :-
|
|
P(X, Y),
|
|
map_p(P, Xs, Ys).
|
|
|
|
:- pred doit(pred).
|
|
:- mode doit((pred) is semidet).
|
|
doit(P) :- P.
|
|
|
|
main -->
|
|
{ L1 = [1,2,3] },
|
|
{ L2 = map_f((func(X::in) = (Y::out) is det :- Y = 2*X), L1) },
|
|
{ map_p((pred(X::in, Y::out) is det :- Y = 2*X), L2, L3) },
|
|
{ L4 = map_f((func(X2) = Y2 :- Y2 = 5*X2), L3) },
|
|
{ L = map_f(func(X3) = 10*X3, L4) },
|
|
{ Foldit = (pred(IO0::di, IO::uo) is det :-
|
|
list__foldl(io__write_int, L, IO0, IO)) },
|
|
Foldit,
|
|
{ Write = io__write_string },
|
|
Write("\n"),
|
|
(if { doit(semidet_succeed) } then
|
|
Write("Yes.\n")
|
|
else
|
|
Write("No.\n")
|
|
).
|
|
|