mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-24 13:53:54 +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.
87 lines
3.0 KiB
Mathematica
87 lines
3.0 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "rotateprune" Benchmark.
|
|
% Part of the DPPD Library.
|
|
%
|
|
% A quite sophisticated deforestation example (originally by
|
|
% Proietti/Pettorossi ?). This benchmark contains no built-in's nor
|
|
% negations. This particular benchmark program is treated in more detail
|
|
% e.g. in the technical report CW 226.
|
|
|
|
:- module rotateprune.
|
|
|
|
:- interface.
|
|
|
|
:- pred rotateprune is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module rotateprune_impl.
|
|
:- import_module run.
|
|
|
|
rotateprune :-
|
|
rp(tree(leaf(s(zero)), s(s(zero)), leaf(s(s(zero)))), Res1),
|
|
use(Res1),
|
|
rp(tree(leaf(s(zero)), s(s(zero)), tree(leaf(s(s(zero))), zero,
|
|
leaf(s(s(s(zero)))))), Res2),
|
|
use(Res2),
|
|
rp(tree(tree(leaf(s(zero)), s(s(zero)), leaf(s(s(zero)))), s(s(zero)),
|
|
tree(leaf(s(s(zero))), zero, tree(leaf(s(s(s(s(zero))))),
|
|
s(s(s(s(zero)))), leaf(s(s(s(s(s(zero))))))))), Res3),
|
|
use(Res3),
|
|
rp(tree(tree(leaf(s(zero)), s(s(zero)), tree(leaf(s(zero)), s(s(zero)),
|
|
tree(leaf(s(s(zero))), s(s(s(s(zero)))), leaf(s(s(s(zero))))))),
|
|
s(s(zero)),
|
|
tree(leaf(s(s(zero))), s(s(s(s(zero)))),
|
|
tree(leaf(s(s(s(s(zero))))), s(s(s(s(zero)))),
|
|
tree(leaf(s(s(s(s(zero))))), s(s(s(s(zero)))),
|
|
tree(leaf(s(s(s(s(zero))))), zero, leaf(s(s(s(s(zero)))))))))), Res4),
|
|
use(Res4).
|
|
|
|
% The partial deduction query
|
|
%
|
|
% :- rp(T1, T2).
|
|
%
|
|
% The run-time queries
|
|
%
|
|
% :- rp(tree(leaf(s(zero)), s(s(zero)), leaf(s(s(zero)))), Res).
|
|
% :- rp(tree(leaf(s(zero)), s(s(zero)), tree(leaf(s(s(zero))), zero,
|
|
% leaf(s(s(s(zero)))))), Res).
|
|
% :- rp(tree(tree(leaf(s(zero)), s(s(zero)), leaf(s(s(zero)))), s(s(zero)),
|
|
% tree(leaf(s(s(zero))), zero, tree(leaf(s(s(s(s(zero))))), s(s(s(s(zero)))),
|
|
% leaf(s(s(s(s(s(zero))))))))), Res).
|
|
% :- rp(tree(tree(leaf(s(zero)), s(s(zero)), tree(leaf(s(zero)), s(s(zero)),
|
|
% tree(leaf(s(s(zero))), s(s(s(s(zero)))), leaf(s(s(s(zero))))))), s(s(zero)),
|
|
% tree(leaf(s(s(zero))), s(s(s(s(zero)))),
|
|
% tree(leaf(s(s(s(s(zero))))), s(s(s(s(zero)))),
|
|
% tree(leaf(s(s(s(s(zero))))), s(s(s(s(zero)))),
|
|
% tree(leaf(s(s(s(s(zero))))), zero, leaf(s(s(s(s(zero)))))))))), Res).
|
|
%
|
|
% Example solution
|
|
%
|
|
% The following can be obtained by the ECCE partial deduction system.
|
|
% It runs considerably faster than the original program (more than 5 times
|
|
% actually).
|
|
%
|
|
% rp__1(X1, X2) :-
|
|
% rotate_conj__2(X1, X2).
|
|
%
|
|
% rotate_conj__2(leaf(X1), leaf(X1)).
|
|
% rotate_conj__2(tree(X1, zero, X2), leaf(zero)) :-
|
|
% rotate__4(X1),
|
|
% rotate__4(X2).
|
|
% rotate_conj__2(tree(X1, s(X2), X3), tree(X4, s(X2), X5)) :-
|
|
% rotate_conj__2(X1, X4),
|
|
% rotate_conj__2(X3, X5).
|
|
% rotate_conj__2(tree(X1, s(X2), X3), tree(X4, s(X2), X5)) :-
|
|
% rotate_conj__2(X1, X5),
|
|
% rotate_conj__2(X3, X4).
|
|
%
|
|
% rotate__4(leaf(X1)).
|
|
% rotate__4(tree(X1, X2, X3)) :-
|
|
% rotate__4(X1), rotate__4(X3).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|