mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-28 15:54:18 +00:00
f03995c7bd
Estimated hours taken: 15 Branches: main Support currying of multi-moded predicates or functions when the mode to curry can be determined from the insts of the higher-order arguments. e.g. mymap(P, L0, L) :- map(wrap(P), L0, L). :- pred wrap(...). :- mode wrap(in(pred(...) is det), ...) is det. :- mode wrap(in(pred(...) is cc_multi, ...) is cc_multi. ... compiler/post_typecheck.m: Don't abort immediately on taking the address of a multi-moded predicate. Leave the proc_id as invalid_proc_id and handle that in polymorphism.m. compiler/polymorphism.m: Convert higher order terms to lambda goals even if the proc_id is invalid (as above) moded by arbitrarily using the first mode. Then polymorphism can proceed as usual. Mark the goals with feature `feature_lambda_undetermined_mode', which tells mode checking to handle it. Add a predicate to fix up such lambda goals once mode checking does figure out which mode should be called. compiler/modecheck_unify.m: compiler/mode_errors.m: Handle goals with the `feature_lambda_undetermined_mode'. Try to select a unique mode for the curried predicate then fix up the lambda goal. compiler/hlds_goal.m: compiler/saved_vars.m: Add `feature_lambda_undetermined_mode'. compiler/goal_util.m: Add a predicate to return all the pred_ids called in a goal with the associated argument variables. NEWS: doc/reference_manual.texi: Document and announce the change. tests/hard_coded/Mmakefile: tests/hard_coded/multimode_addr.exp: tests/hard_coded/multimode_addr.m: tests/invalid/Mmakefile: tests/invalid/multimode_addr_problems.err_exp: tests/invalid/multimode_addr_problems.m: Add tests.
100 lines
3.2 KiB
Mathematica
100 lines
3.2 KiB
Mathematica
% Take addresses of multimoded predicates and functions.
|
|
|
|
:- module multimode_addr.
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module int.
|
|
:- import_module list.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
main(!IO) :-
|
|
io.write_string("TEST 1\n", !IO),
|
|
Rev = my_foldl(cons, 1 .. 5, []),
|
|
io.write(Rev, !IO),
|
|
io.nl(!IO),
|
|
|
|
io.write_string("\nTEST 2\n", !IO),
|
|
!:IO = my_foldl(echo, ["a", "b", "c"], !.IO),
|
|
|
|
io.write_string("\nTEST 3\n", !IO),
|
|
( RevB = my_foldl(maybe_cons, 1 .. 5, []) ->
|
|
io.write(RevB, !IO),
|
|
io.nl(!IO)
|
|
;
|
|
io.write_string("found a multiple of three\n", !IO)
|
|
).
|
|
|
|
:- func my_foldl(func(L, A) = A, list(L), A) = A.
|
|
:- mode my_foldl(in(func(in, in) = out is semidet), in, in) = out is semidet.
|
|
:- mode my_foldl(in(func(in, di) = uo is det), in, di) = uo is det.
|
|
:- mode my_foldl(in(func(in, in) = out is det), in, in) = out is det.
|
|
|
|
my_foldl(F, L, A0) = A :-
|
|
list.foldl(f2p(F), L, A0, A).
|
|
|
|
% Changing the type signature causes polymorphism.m to produce a lambda goal
|
|
% which is more than just a plain_call. It creates type_infos before the
|
|
% actual call.
|
|
:- func my_foldl_b(func(int, A) = A, list(int), A) = A.
|
|
:- mode my_foldl_b(in(func(in, in) = out is semidet), in, in) = out is semidet.
|
|
:- mode my_foldl_b(in(func(in, di) = uo is det), in, di) = uo is det.
|
|
:- mode my_foldl_b(in(func(in, in) = out is det), in, in) = out is det.
|
|
|
|
my_foldl_b(F, L, A0) = A :-
|
|
list.foldl(f2p(F), L, A0, A).
|
|
|
|
% Some reordering.
|
|
:- func my_foldl_silly(func(L, A) = A, list(L), A) = A.
|
|
:- mode my_foldl_silly(in(func(in, in) = out is semidet), in, in) = out
|
|
is semidet.
|
|
:- mode my_foldl_silly(in(func(in, di) = uo is det), in, di) = uo is det.
|
|
:- mode my_foldl_silly(in(func(in, in) = out is det), in, in) = out is det.
|
|
|
|
my_foldl_silly(F, L, A0) = A :-
|
|
list.foldl(P, L, A0, A),
|
|
P = f2p(F1),
|
|
F1 = F.
|
|
|
|
:- pred f2p(func(L, A) = A, L, A, A).
|
|
:- mode f2p(in(func(in, di) = uo is det), in, di, uo) is det.
|
|
:- mode f2p(in(func(in, in) = out is det), in, in, out) is det.
|
|
:- mode f2p(in(func(in, in) = out is semidet), in, in, out) is semidet.
|
|
|
|
:- pragma promise_equivalent_clauses(f2p/4).
|
|
|
|
f2p(F::in(func(in, di) = uo is det), L::in, A0::di, A::uo) :-
|
|
trace [io(!IO)] io.write_string("f2p: det, unique\n", !IO),
|
|
F(L, A0) = A.
|
|
|
|
f2p(F::in(func(in, in) = out is det), L::in, A0::in, A::out) :-
|
|
trace [io(!IO)] io.write_string("f2p: det, not unique\n", !IO),
|
|
F(L, A0) = A.
|
|
|
|
f2p(F::in(func(in, in) = out is semidet), L::in, A0::in, A::out) :-
|
|
trace [io(!IO)] io.write_string("f2p: semidet\n", !IO),
|
|
F(L, A0) = A.
|
|
|
|
:- func echo(string::in, io::di) = (io::uo) is det.
|
|
|
|
echo(S, IO0) = IO :-
|
|
io.write_string(S, IO0, IO1),
|
|
io.nl(IO1, IO).
|
|
|
|
:- func maybe_cons(int::in, list(int)::in) = (list(int)::out) is semidet.
|
|
|
|
maybe_cons(X, Xs) = [X | Xs] :-
|
|
mod(X, 3) \= 0.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% vim: ft=mercury ts=8 sw=4 et wm=0 tw=0
|