mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-20 03:43:51 +00:00
fdd141bf77
tests/invalid/*.{m,err_exp}:
tests/misc_tests/*.m:
tests/mmc_make/*.m:
tests/par_conj/*.m:
tests/purity/*.m:
tests/stm/*.m:
tests/string_format/*.m:
tests/structure_reuse/*.m:
tests/submodules/*.m:
tests/tabling/*.m:
tests/term/*.m:
tests/trailing/*.m:
tests/typeclasses/*.m:
tests/valid/*.m:
tests/warnings/*.{m,exp}:
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 tests
that check compiler error messages, expect the new line numbers.
browser/cterm.m:
browser/tree234_cc.m:
Import only one module per line.
tests/hard_coded/boyer.m:
Fix something I missed.
70 lines
1.8 KiB
Mathematica
70 lines
1.8 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module higher_order5.
|
|
|
|
:- interface.
|
|
|
|
:- pred definite_vars(robdd(T)::in, vars_entailed_result(T)::out,
|
|
vars_entailed_result(T)::out) is det.
|
|
|
|
:- type robdd(T).
|
|
|
|
:- type entailment_result(T)
|
|
---> all_vars
|
|
; some_vars(vars :: T).
|
|
|
|
:- type vars_entailed_result(T) == entailment_result(sparse_bitset(T)).
|
|
|
|
:- type pair(T, U)
|
|
---> pair(T, U).
|
|
|
|
:- type sparse_bitset(T)
|
|
---> sparse_bitset(T).
|
|
|
|
:- type equivalent_vars_map(T)
|
|
---> equivalent_vars_map(pair(T, T)).
|
|
|
|
:- type equivalent_result(T) == entailment_result(equivalent_vars_map(T)).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- type robdd(T)
|
|
---> robdd(int).
|
|
|
|
definite_vars(R, T, F) :-
|
|
definite_vars(id(R), T_tr, F_tr),
|
|
T = T_tr `intersection` T_tr,
|
|
F = F_tr `intersection` F_tr.
|
|
|
|
:- func id(T) = T.
|
|
id(T) = T.
|
|
|
|
:- type imp_res_2(T)
|
|
---> imps(pair(T, vars_entailed_result(T))).
|
|
|
|
:- typeclass intersectable(T) where [
|
|
func T `intersection` T = T
|
|
].
|
|
|
|
:- instance intersectable(sparse_bitset(T)) where [
|
|
intersection(sparse_bitset(A), _) = sparse_bitset(A)
|
|
].
|
|
|
|
:- instance intersectable(entailment_result(T)) <= intersectable(T) where [
|
|
( all_vars `intersection` R = R ),
|
|
( some_vars(Vs) `intersection` all_vars = some_vars(Vs) ),
|
|
( some_vars(Vs0) `intersection` some_vars(Vs1) =
|
|
some_vars(Vs0 `intersection` Vs1) )
|
|
].
|
|
|
|
:- instance intersectable(imp_res_2(T)) where [
|
|
imps(pair(A, ResA)) `intersection` imps(pair(_, ResB)) =
|
|
imps(pair(A, intersection(ResA, ResB)))
|
|
].
|
|
|
|
%---------------------------------------------------------------------------%
|