mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-17 14:57:03 +00:00
459847a064
Estimated hours taken: 18 Branches: main Move the univ, maybe, pair and unit types from std_util into their own modules. std_util still contains the general purpose higher-order programming constructs. library/std_util.m: Move univ, maybe, pair and unit (plus any other related types and procedures) into their own modules. library/maybe.m: New module. This contains the maybe and maybe_error types and the associated procedures. library/pair.m: New module. This contains the pair type and associated procedures. library/unit.m: New module. This contains the types unit/0 and unit/1. library/univ.m: New module. This contains the univ type and associated procedures. library/library.m: Add the new modules. library/private_builtin.m: Update the declaration of the type_ctor_info struct for univ. runtime/mercury.h: Update the declaration for the type_ctor_info struct for univ. runtime/mercury_mcpp.h: runtime/mercury_hlc_types.h: Update the definition of MR_Univ. runtime/mercury_init.h: Fix a comment: ML_type_name is now exported from type_desc.m. compiler/mlds_to_il.m: Update the the name of the module that defines univs (which are handled specially by the il code generator.) library/*.m: compiler/*.m: browser/*.m: mdbcomp/*.m: profiler/*.m: deep_profiler/*.m: Conform to the above changes. Import the new modules where they are needed; don't import std_util where it isn't needed. Fix formatting in lots of modules. Delete duplicate module imports. tests/*: Update the test suite to confrom to the above changes.
21 lines
493 B
Mathematica
21 lines
493 B
Mathematica
:- module complex_constraint_err.
|
|
:- interface.
|
|
:- import_module pair, map, list.
|
|
|
|
:- typeclass foo(A, B, C) <= (A -> B) where [].
|
|
:- typeclass bar(B, C) <= (B -> C) where [].
|
|
|
|
% Error: C is not determined.
|
|
:- pred t(A) <= (foo(A, B, C), bar(B, C1)).
|
|
:- mode t(in) is semidet.
|
|
|
|
% Error: X and Z are not determined.
|
|
:- pred u(A) <= (foo(A, pair(W, X1), map(Y, Z)), bar(W, Y), bar(X, list(Z))).
|
|
:- mode u(in) is semidet.
|
|
|
|
:- implementation.
|
|
|
|
t(_) :- semidet_succeed.
|
|
u(_) :- semidet_succeed.
|
|
|