mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-18 23:35:25 +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.
30 lines
588 B
Mathematica
30 lines
588 B
Mathematica
% This module tests the use of existential types,
|
|
% including type inference.
|
|
|
|
:- module existential_reordering_class.
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io__state::di, state::uo) is det.
|
|
|
|
:- implementation.
|
|
:- import_module enum, int, univ, list.
|
|
|
|
main -->
|
|
% do something which requires knowing the type of L
|
|
{ L = [] },
|
|
{ Univ = univ(L) },
|
|
write(Univ),
|
|
nl,
|
|
|
|
% now do something which binds the type of L
|
|
{ same_type(L, [my_exist_t]) }.
|
|
|
|
:- pred same_type(T::unused, T::unused) is det.
|
|
same_type(_, _).
|
|
|
|
:- some [T] func my_exist_t = T => enum(T).
|
|
|
|
my_exist_t = 42.
|