mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-15 17:33:38 +00:00
33eb3028f5
tests/accumulator/*.m:
tests/analysis_*/*.m:
tests/benchmarks*/*.m:
tests/debugger*/*.{m,exp,inp}:
tests/declarative_debugger*/*.{m,exp,inp}:
tests/dppd*/*.m:
tests/exceptions*/*.m:
tests/general*/*.m:
tests/grade_subdirs*/*.m:
tests/hard_coded*/*.m:
Make these tests use four-space indentation, and ensure that
each module is imported on its own line. (I intend to use the latter
to figure out which subdirectories' tests can be executed in parallel.)
These changes usually move code to different lines. For the debugger tests,
specify the new line numbers in .inp files and expect them in .exp files.
70 lines
2.5 KiB
Mathematica
70 lines
2.5 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "ex_depth" Benchmark
|
|
% Part of the DPPD Library.
|
|
%
|
|
% A (more difficult) variation of the Lam & Kusalik depth benchmark
|
|
% using a different meta-interpreter. It consists of a simple non-ground
|
|
% meta-interpreter which has to be specialised for a (not
|
|
% fully-unfoldable) object program. It uses neither negations nor
|
|
% built-ins.
|
|
|
|
solve([], Depth, Depth).
|
|
solve([Head | Tail], DepthSoFar, Res) :-
|
|
claus(Head, Body),
|
|
solve(Body, s(DepthSoFar), IntDepth),
|
|
solve(Tail, IntDepth, Res).
|
|
|
|
claus(member(X, [X | T]), []).
|
|
claus(member(X, [Y | T]), [member(X, T)]).
|
|
|
|
claus(inboth(X, L1, L2), [member(X, L1), member(X, L2)]).
|
|
|
|
claus(app([], L, L), []).
|
|
claus(app([H | X], Y, [H | Z]), [app(X, Y, Z)]).
|
|
|
|
claus(delete(X, [X | T], T), []).
|
|
claus(delete(X, [Y | T], [Y | D]), [delete(X, T, D)]).
|
|
|
|
claus(test(A, L1, L2, Res),
|
|
[inboth(A, L1, L2), delete(A, L1, D1), app(D1, L2, Res)]).
|
|
|
|
% The partial deduction query
|
|
%
|
|
% :- solve([inboth(X, Y, Z)], 0, Depth).
|
|
%
|
|
% The run-time queries
|
|
%
|
|
% :- solve([inboth(d, [a, b, c, d, e, f, d], [f, e, d, c, b, a])], 0, Depth).
|
|
% :- solve([inboth(a, [a, b, c, d, e, f, d], [f, e, d, c, b, a])], 0, Depth).
|
|
% :- solve([inboth(d, [], [f, e, d, c, b, a])], 0, Depth).
|
|
% :- solve([inboth(d, [a, b, c, d, e, f, d], [])], 0, Depth).
|
|
% :- solve([inboth(g, [a, b, c, d, e, f, d], [f, e, d, c, b, a])], 0, Depth).
|
|
% :- solve([inboth(a, [a], [b])], 0, Depth).
|
|
% :- solve([inboth(e, [a, b, c, d, e, f, d, e, g, h, i, l, m, n],
|
|
% [f, e, d, c, b, a])], 0, Depth).
|
|
% :- solve([inboth(d, [a, b, c, d, e, f, d, e, g, h, i, l, m, n],
|
|
% [a, b, c, d, e, f, d, e, g, h, i, l, m, n])], 0, Depth).
|
|
% :- solve([inboth(X, [a, b, c, d, e, f, d, e, g, h, i, l, m, n],
|
|
% [a, b, c, d, e, f, d, e, g, h, i, l, m, n])], 0, Depth).
|
|
%
|
|
% Example solution
|
|
%
|
|
% With the ECCE partial deduction system one can obtain the following
|
|
% (which runs 3 times faster than the original, slightly faster versions
|
|
% can also be obtained):
|
|
%
|
|
% solve__1(X1, [X1 | X2], X3, X4) :-
|
|
% solve__2(X1, X3, s(s(0)), X4).
|
|
% solve__1(X1, [X2 | X3], X4, X5) :-
|
|
% solve__2(X1, X3, s(s(0)), X6),
|
|
% solve__2(X1, X4, X6, X5).
|
|
%
|
|
% solve__2(X1, [X1 | X2], X3, s(X3)).
|
|
% solve__2(X1, [X2 | X3], X4, X5) :-
|
|
% solve__2(X1, X3, s(X4), X5).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|