mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-10 11:23:15 +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.
88 lines
3.0 KiB
Mathematica
88 lines
3.0 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The "flip" Benchmark
|
|
% Part of the DPPD Library.
|
|
%
|
|
% A simple deforestation example from Wadler. The benchmark program
|
|
% flips a tree structure twice (thus returning the original tree back).
|
|
|
|
:- module flip.
|
|
|
|
:- interface.
|
|
|
|
:- pred flip is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module flip_impl.
|
|
:- import_module run.
|
|
|
|
flip :-
|
|
flipflip(tree(leaf(s(zero)), s(s(zero)), leaf(s(s(zero)))), Res1),
|
|
use(Res1),
|
|
flipflip(tree(leaf(s(zero)), s(s(zero)), tree(leaf(s(s(zero))), zero,
|
|
leaf(s(s(s(zero)))))), Res2),
|
|
use(Res2),
|
|
flipflip(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),
|
|
flipflip(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
|
|
%
|
|
% :- flipflip(T1, T2).
|
|
%
|
|
% The run-time queries
|
|
%
|
|
% :- flipflip(tree(leaf(s(0)), s(s(0)), leaf(s(s(0)))), Res).
|
|
% :- flipflip(tree(leaf(s(0)), s(s(0)), tree(leaf(s(s(0))), 0,
|
|
% leaf(s(s(s(0)))))), Res).
|
|
% :- flipflip(tree(tree(leaf(s(0)), s(s(0)), leaf(s(s(0)))), s(s(0)),
|
|
% tree(leaf(s(s(0))), 0, tree(leaf(s(s(s(s(0))))), s(s(s(s(0)))),
|
|
% leaf(s(s(s(s(s(0))))))))), Res).
|
|
% :- flipflip(tree(tree(leaf(s(0)), s(s(0)), tree(leaf(s(0)), s(s(0)),
|
|
% tree(leaf(s(s(0))), s(s(s(s(0)))), leaf(s(s(s(0))))))), s(s(0)),
|
|
% tree(leaf(s(s(0))), s(s(s(s(0)))),
|
|
% tree(leaf(s(s(s(s(0))))), s(s(s(s(0)))),
|
|
% tree(leaf(s(s(s(s(0))))), s(s(s(s(0)))),
|
|
% tree(leaf(s(s(s(s(0))))), 0, leaf(s(s(s(s(0)))))))))), Res).
|
|
%
|
|
% Example solution
|
|
%
|
|
% The following program can be obtained by the ECCE partial deduction system.
|
|
% It runs about 30% faster than the original.
|
|
%
|
|
% flipflip__1(X1, X2) :-
|
|
% flip_conj__2(X1, X2).
|
|
%
|
|
% flip_conj__2(leaf(X1), leaf(X1)).
|
|
% flip_conj__2(tree(X1, X2, X3), tree(X4, X2, X5)) :-
|
|
% flip_conj__2(X1, X4),
|
|
% flip_conj__2(X3, X5).
|
|
%
|
|
% Combined with a bottom-up propagation (for more details see the
|
|
% technical report CW 232) ECCE can also obtain the following program
|
|
% which runs 45 % faster than the original:
|
|
%
|
|
% flipflip__1(X1, X1) :-
|
|
% flip_conj__2(X1).
|
|
%
|
|
% flip_conj__2(leaf(X1)).
|
|
% flip_conj__2(tree(X1, X2, X3)) :-
|
|
% flip_conj__2(X1),
|
|
% flip_conj__2(X3).
|
|
%
|
|
% Michael Leuschel / K.U. Leuven / michael@cs.kuleuven.ac.be
|