mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-22 21:03:53 +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.
61 lines
1.7 KiB
Mathematica
61 lines
1.7 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "applast" Benchmark.
|
|
% Part of the DPPD Library.
|
|
%
|
|
% This is a benchmark by Michael Leuschel which contains no builtins
|
|
% or negations. Solving this benchmarks requires conjunctive partial deductions
|
|
% as well as a bottom-up success propagation. It is a simple example which
|
|
% illustrates the difficulties that can arise when specialising the ground
|
|
% representation. More details can be found in the technical reports CW 210
|
|
% and CW 232.
|
|
|
|
:- module applast.
|
|
|
|
:- interface.
|
|
|
|
:- pred applast is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module applast_impl.
|
|
:- import_module list.
|
|
:- import_module run.
|
|
|
|
applast :-
|
|
% not well moded.
|
|
% applast([a, b, c, d], L1, e),
|
|
% use(L1),
|
|
applast([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t,
|
|
u, v, a, a, b, w, x, y], z, L2),
|
|
use(L2),
|
|
applast([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t,
|
|
u, v, a, a, b, w, x, y], z, q).
|
|
|
|
% The partial deduction query
|
|
%
|
|
% :- applast(L, X, Last).
|
|
%
|
|
% The run-time queries
|
|
%
|
|
% :- applast([a, b, c, d], L, e).
|
|
% :- applast([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t,
|
|
% u, v, a, a, b, w, x, y], z, L).
|
|
% :- applast([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t,
|
|
% u, v, a, a, b, w, x, y], z, q).
|
|
%
|
|
% Example solution
|
|
%
|
|
% Combined with a bottom-up propagation (for more details see the
|
|
% technical report CW 232) the ECCE partial deduction system can obtain
|
|
% the following program:
|
|
%
|
|
% applast__1(L, a) :- al(L).
|
|
%
|
|
% al([]).
|
|
% al([H | T]) :- al(T).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|