☰

*ON THIS PAGE*# termsd: types with shortening (abstract domain)

**Author(s):** Claudio Vaucheret, Francisco Bueno, Ciao Development Team.## Usage and interface

## Documentation on exports

## Documentation on multifiles

## Documentation on imports

This module has the following direct dependencies:

- The CiaoPP Program Processor »

- PART I - Using CiaoPP »

- Available abstract domains »

**termsd: types with shortening (abstract domain)**

This module implements the abstract operations of the type domains with widening based on shortening (`shortening_el/3`). An abstract sustitution is a list of `Var:Type` elements, where Var is a variable and Type is a pure type term [DZ92].

**Library usage:**`:- use_module(domain(termsd)).`**Exports:***Predicates:*`terms_input_interface/4`,`terms_concrete/3`,`terms_compute_lub/2`,`terms_compute_lub_el/3`,`terms_widencall/3`,`terms_needs/1`,`terms_widen/3`,`terms_init_abstract_domain/1`,`terms_call_to_entry/9`,`variables_are_variable_type/2`,`terms_exit_to_prime/7`,`unify_term_and_type_term/5`,`generate_a_type_assignment/3`,`get_var_types_by_unification/3`,`compute_type/3`,`find_list_entry/3`,`terms_project/5`,`terms_abs_sort/2`,`terms_extend/5`,`terms_less_or_equal/2`,`terms_glb/3`,`terms_unknown_entry/3`,`terms_empty_entry/3`,`terms_unknown_call/4`,`substitution/3`,`variables_are_top_type/2`,`terms_call_to_success_fact/9`,`terms_special_builtin/5`,`terms_success_builtin/6`,`terms_call_to_success_builtin/6`,`precondition_builtin/2`,`postcondition_builtin/4`,`terms_input_user_interface/5`,`terms_asub_to_native/5`,`terms_internal_to_native/3`,`terms_output_interface/2`,`terms_collect_auxinfo_asub/3`,`terms_rename_auxinfo_asub/3`,`terms_identical_abstract/2`.*Multifiles:*`aidomain/1`,`aidom.init_abstract_domain/2`,`aidom.amgu/5`,`aidom.augment_asub/4`,`aidom.augment_two_asub/4`,`aidom.call_to_entry/10`,`aidom.exit_to_prime/8`,`aidom.project/6`,`aidom.widencall/4`,`aidom.needs/2`,`aidom.widen/4`,`aidom.compute_lub/3`,`aidom.compute_clauses_lub/4`,`aidom.compute_clauses_glb/4`,`aidom.fixpoint_covered/3`,`aidom.fixpoint_covered_gfp/3`,`aidom.identical_abstract/3`,`aidom.abs_sort/3`,`aidom.extend/6`,`aidom.less_or_equal/3`,`aidom.glb/4`,`aidom.eliminate_equivalent/3`,`aidom.abs_subset/3`,`aidom.call_to_success_fact/10`,`aidom.special_builtin/6`,`aidom.combined_special_builtin0/3`,`aidom.body_succ_builtin/9`,`aidom.split_combined_domain/4`,`aidom.success_builtin/7`,`aidom.call_to_success_builtin/7`,`aidom.obtain_info/5`,`aidom.input_interface/5`,`aidom.input_user_interface/6`,`aidom.asub_to_native/6`,`aidom.concrete/4`,`aidom.unknown_call/5`,`aidom.unknown_entry/4`,`aidom.empty_entry/4`,`aidom.part_conc/5`,`aidom.multi_part_conc/4`,`aidom.collect_auxinfo_asub/4`,`aidom.rename_auxinfo_asub/4`,`aidom.dom_statistics/2`,`aidom.contains_parameters/2`.

PREDICATEterms_input_interface/4

No further documentation available for this predicate.

PREDICATEterms_concrete/3

No further documentation available for this predicate.

PREDICATEterms_compute_lub/2

Usage:`terms_compute_lub(ListASub,Lub)`

It computes the least upper bound of a set of abstract substitutions. For each two abstract substitutions ASub1 and ASub2 in ListASub, obtaining the lub is foreach X:Type1 in ASub1 and X:Type2 in ASub2, X:TypeUnion is in Lub, and TypeUnion is the deterministic union of Type1 an Type2.

*The following properties should hold at call time:*

(`nonvar/1`)ListASub is currently a term which is not a free variable.

(`var/1`)Lub is a free variable.

(`list/2`)ListASub is a list of termsd_asubs.*The following properties should hold upon exit:*

(`termsd_asub/1`)Lub is an abstract substitution

PREDICATEterms_compute_lub_el/3

No further documentation available for this predicate.

PREDICATEterms_widencall/3

No further documentation available for this predicate.

PREDICATEterms_needs/1

No further documentation available for this predicate.

PREDICATEterms_widen/3

Usage:`terms_widen(Prime0,Prime1,NewPrime)`

Induction step on the abstract substitution of a fixpoint. Prime0 corresponds to non-recursive and Prime1 to recursive clauses. NewPrime is the result of apply one widening operation to the least upper bound of the formers. Widening operations implemented are “shortening” and “restricted shortening” [GdW94,SG94].

*The following properties should hold at call time:*

(`nonvar/1`)Prime0 is currently a term which is not a free variable.

(`nonvar/1`)Prime1 is currently a term which is not a free variable.

(`var/1`)NewPrime is a free variable.

(`termsd_asub/1`)Prime0 is an abstract substitution

(`termsd_asub/1`)Prime1 is an abstract substitution

(`term/1`)NewPrime is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)NewPrime is an abstract substitution

PREDICATEterms_init_abstract_domain/1

No further documentation available for this predicate.

PREDICATEterms_call_to_entry/9

Usage:`terms_call_to_entry(Sv,Sg,Hv,Head,K,Fv,Proj,Entry,ExtraInfo)`

It obtains the abstract substitution Entry which results from adding the abstraction of the Sg = Head to Proj, later projecting the resulting substitution onto Hv.

This is done as follows:

- If Sg and Head are identical up to renaming it is just renaming Proj and adding the Fv
- Otherwise, it will:
- obtain the abstract substitution from unifying Sg and Head calling “unify_term_and_type_term”
- add to this abstract substituion the variables in Fv as term type.

The meaning of the variables is:

- Sg is the subgoal being analysed.
- Head is the Head of the clause being analysed.
- Fv is a list of free variables in the body of the clause being considered.
- Proj is the abstract substitution Call projected onto Sv.
- Entry is the Abstract entry substitution (i.e. the abstract subtitution obtained after the abstract unification of Sg and Head projected onto Hv + Fv).
- ExtraInfo is a flag
`yes`when no unification is required, i.e.,`Entry=Proj`upto names of vars. and ignoring Fv. It is`no`if unification fails.

*The following properties should hold at call time:*

(`nonvar/1`)Sv is currently a term which is not a free variable.

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Hv is currently a term which is not a free variable.

(`nonvar/1`)Head is currently a term which is not a free variable.

(`nonvar/1`)K is currently a term which is not a free variable.

(`nonvar/1`)Fv is currently a term which is not a free variable.

(`nonvar/1`)Proj is currently a term which is not a free variable.

(`var/1`)Entry is a free variable.

(`var/1`)ExtraInfo is a free variable.

(`term/1`)Sv is any term.

(`cgoal/1`)Sg is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Hv is a list.

(`cgoal/1`)Head is a term which represents a goal, i.e., an atom or a structure.

(`term/1`)K is any term.

(`list/1`)Fv is a list.

(`termsd_asub/1`)Proj is an abstract substitution

(`term/1`)Entry is any term.

(`term/1`)ExtraInfo is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Entry is an abstract substitution

(`termsd_extrainfo/1`)`termsd_extrainfo(ExtraInfo)`

PREDICATEvariables_are_variable_type/2

Usage:`variables_are_variable_type(Fv,ASub)`

(at the moment) assigns the value top_type to the variables in Fv but in the future it must assign the value `var`

*The following properties should hold at call time:*

(`nonvar/1`)Fv is currently a term which is not a free variable.

(`var/1`)ASub is a free variable.

(`list/1`)Fv is a list.*The following properties should hold upon exit:*

(`termsd_asub/1`)ASub is an abstract substitution

PREDICATEterms_exit_to_prime/7

Usage:`terms_exit_to_prime(Sg,Hv,Head,Sv,Exit,ExtraInfo,Prime)`

It computes the prime abstract substitution Prime, i.e. the result of going from the abstract substitution over the head variables Exit, to the abstract substitution over the variables in the subgoal. It will:

- If Exit is '$bottom', Prime will be also '$bottom'.
- If ExtraInfo = yes (Head and Sg identical up to renaming) it is just renaming Exit %
- Otherwise, it will:
- projects Exit onto Hv obtaining BPrime.
- obtain the abstract substitution from unifying Sg and Head calling “unify_term_and_type_term”

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Hv is currently a term which is not a free variable.

(`nonvar/1`)Head is currently a term which is not a free variable.

(`nonvar/1`)Sv is currently a term which is not a free variable.

(`nonvar/1`)Exit is currently a term which is not a free variable.

(`nonvar/1`)ExtraInfo is currently a term which is not a free variable.

(`var/1`)Prime is a free variable.

(`cgoal/1`)Sg is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Hv is a list.

(`cgoal/1`)Head is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Sv is a list.

(`termsd_asub/1`)Exit is an abstract substitution

(`termsd_extrainfo/1`)`termsd_extrainfo(ExtraInfo)`

(`term/1`)Prime is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Prime is an abstract substitution

PREDICATEunify_term_and_type_term/5

Usage:`unify_term_and_type_term(Term1,Tv,Term2,ASub,NewASub)`

It unifies the term Term1 to the type term Term2 obtaining the the abstract substitution TypeAss which is sorted and projeted on Tv

*The following properties should hold at call time:*

(`nonvar/1`)Term1 is currently a term which is not a free variable.

(`nonvar/1`)Tv is currently a term which is not a free variable.

(`nonvar/1`)Term2 is currently a term which is not a free variable.

(`nonvar/1`)ASub is currently a term which is not a free variable.

(`var/1`)NewASub is a free variable.

(`cgoal/1`)Term1 is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Tv is a list.

(`cgoal/1`)Term2 is a term which represents a goal, i.e., an atom or a structure.

(`termsd_asub/1`)ASub is an abstract substitution

(`term/1`)NewASub is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)NewASub is an abstract substitution

PREDICATEgenerate_a_type_assignment/3

No further documentation available for this predicate.

PREDICATEget_var_types_by_unification/3

No further documentation available for this predicate.

PREDICATEcompute_type/3

Usage:`compute_type(Term,Type,Types)`

Given the term Term and a type Type, computes the type corresponding to each variable in Term, and store it in the data structure Types. Types have the structure [vt(Var1, TypeList1), ..., vt(VarN, TypeListN)|_], where TypeListN is the list of types corresponding to variable VarN.

*The following properties should hold at call time:*

(`nonvar/1`)Type is currently a term which is not a free variable.

PREDICATEfind_list_entry/3

No further documentation available for this predicate.

PREDICATEterms_project/5

Usage:`terms_project(Sg,Vars,HvFv_u,Asub,Proj)`

Proj is the result of eliminating from Asub all X:Value such that X is not in Vars.

HvFv_u may be a list or `not_provided_HvFv_u` and is not used by this predicate.

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Vars is currently a term which is not a free variable.

(`nonvar/1`)HvFv_u is currently a term which is not a free variable.

(`nonvar/1`)Asub is currently a term which is not a free variable.

(`var/1`)Proj is a free variable.

(`term/1`)Sg is any term.

(`list/1`)Vars is a list.

(`term/1`)HvFv_u is any term.

(`termsd_asub/1`)Asub is an abstract substitution

(`term/1`)Proj is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Proj is an abstract substitution

PREDICATEterms_abs_sort/2

Usage:`terms_abs_sort(Asub,Asub_s)`

It sorts the set of X:Type in Asub containing Asub_s

*The following properties should hold at call time:*

(`nonvar/1`)Asub is currently a term which is not a free variable.

(`var/1`)Asub_s is a free variable.

(`termsd_asub/1`)Asub is an abstract substitution*The following properties should hold upon exit:*

(`termsd_asub/1`)Asub_s is an abstract substitution

PREDICATEterms_extend/5

Usage:`terms_extend(Sg,Prime,Sv,Call,Succ)`

If Prime = '$bottom', Succ = '$bottom' otherwise, Succ is computed updating the values of Call with those in Prime

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Prime is currently a term which is not a free variable.

(`nonvar/1`)Sv is currently a term which is not a free variable.

(`nonvar/1`)Call is currently a term which is not a free variable.

(`var/1`)Succ is a free variable.

(`term/1`)Sg is any term.

(`termsd_asub/1`)Prime is an abstract substitution

(`list/1`)Sv is a list.

(`termsd_asub/1`)Call is an abstract substitution

(`term/1`)Succ is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Succ is an abstract substitution

PREDICATEterms_less_or_equal/2

Usage:`terms_less_or_equal(ASub0,ASub1)`

Succeeds if ASub1 is more general or equal to ASub0. it's assumed the two abstract substitutions are defined on the same variables

*The following properties should hold at call time:*

(`nonvar/1`)ASub0 is currently a term which is not a free variable.

(`nonvar/1`)ASub1 is currently a term which is not a free variable.

(`termsd_asub/1`)ASub0 is an abstract substitution

(`termsd_asub/1`)ASub1 is an abstract substitution

PREDICATEterms_glb/3

Usage:`terms_glb(ASub0,ASub1,Glb)`

Glb is the great lower bound of ASub0 and ASub1

*The following properties should hold at call time:*

(`nonvar/1`)ASub0 is currently a term which is not a free variable.

(`nonvar/1`)ASub1 is currently a term which is not a free variable.

(`var/1`)Glb is a free variable.

(`termsd_asub/1`)ASub0 is an abstract substitution

(`termsd_asub/1`)ASub1 is an abstract substitution

(`term/1`)Glb is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Glb is an abstract substitution

PREDICATEterms_unknown_entry/3

Usage:`terms_unknown_entry(Sg,Qv,Call)`

Gives the “top” value for the variables involved in a literal whose definition is not present, and adds this top value to Call. In this domain the top value is X:term forall X in the set of variables

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Qv is currently a term which is not a free variable.

(`var/1`)Call is a free variable.

(`cgoal/1`)Sg is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Qv is a list.

(`term/1`)Call is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Call is an abstract substitution

PREDICATEterms_empty_entry/3

Usage:`terms_empty_entry(Sg,Vars,Entry)`

Gives the "empty" value in this domain for a given set of variables Vars, resulting in the abstract substitution Entry. I.e., obtains the abstraction of a substitution in which all variables Vars are unbound: free and unaliased. In this domain the empty value is giving the variable type to each variable

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Vars is currently a term which is not a free variable.

(`var/1`)Entry is a free variable.

(`cgoal/1`)Sg is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Vars is a list.

(`term/1`)Entry is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Entry is an abstract substitution

PREDICATEterms_unknown_call/4

Usage:`terms_unknown_call(Sg,Vars,Call,Succ)`

Gives the “top” value for the variables involved in a literal whose definition is not present, and adds this top value to Call

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Vars is currently a term which is not a free variable.

(`nonvar/1`)Call is currently a term which is not a free variable.

(`var/1`)Succ is a free variable.

(`cgoal/1`)Sg is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Vars is a list.

(`termsd_asub/1`)Call is an abstract substitution

(`term/1`)Succ is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Succ is an abstract substitution

PREDICATEsubstitution/3

No further documentation available for this predicate.

PREDICATEvariables_are_top_type/2

Usage:`variables_are_top_type(Fv,ASub)`

It assigns the value top_type to the variables in Fv and return the abstract substitution ASub

*The following properties should hold at call time:*

(`nonvar/1`)Fv is currently a term which is not a free variable.

(`var/1`)ASub is a free variable.

(`list/1`)Fv is a list.*The following properties should hold upon exit:*

(`termsd_asub/1`)ASub is an abstract substitution

PREDICATEterms_call_to_success_fact/9

Usage:`terms_call_to_success_fact(Sg,Hv,Head,K,Sv,Call,Proj,Prime,Succ)`

Specialized version of call_to_entry + exit_to_prime + extend for facts

*The following properties should hold at call time:*

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Hv is currently a term which is not a free variable.

(`nonvar/1`)Head is currently a term which is not a free variable.

(`nonvar/1`)K is currently a term which is not a free variable.

(`nonvar/1`)Sv is currently a term which is not a free variable.

(`nonvar/1`)Call is currently a term which is not a free variable.

(`nonvar/1`)Proj is currently a term which is not a free variable.

(`var/1`)Prime is a free variable.

(`var/1`)Succ is a free variable.

(`cgoal/1`)Sg is a term which represents a goal, i.e., an atom or a structure.

(`list/1`)Hv is a list.

(`cgoal/1`)Head is a term which represents a goal, i.e., an atom or a structure.

(`term/1`)K is any term.

(`list/1`)Sv is a list.

(`termsd_asub/1`)Call is an abstract substitution

(`termsd_asub/1`)Proj is an abstract substitution

(`term/1`)Prime is any term.

(`term/1`)Succ is any term.*The following properties should hold upon exit:*

(`termsd_asub/1`)Prime is an abstract substitution

(`termsd_asub/1`)Succ is an abstract substitution

PREDICATEterms_special_builtin/5

Usage:`terms_special_builtin(SgKey,Sg,Subgoal,Type,Condvars)`

Type is a flag indicating what is the abstraction of builtin SgKey and to which variables Condvars of the goal Sg it affects.

*The following properties should hold at call time:*

(`nonvar/1`)SgKey is currently a term which is not a free variable.

(`nonvar/1`)Sg is currently a term which is not a free variable.

(`nonvar/1`)Subgoal is currently a term which is not a free variable.

(`var/1`)Type is a free variable.

(`var/1`)Condvars is a free variable.

PREDICATEterms_success_builtin/6

No further documentation available for this predicate.

PREDICATEterms_call_to_success_builtin/6

No further documentation available for this predicate.

PREDICATEprecondition_builtin/2

No further documentation available for this predicate.

PREDICATEpostcondition_builtin/4

No further documentation available for this predicate.

PREDICATEterms_input_user_interface/5

Usage:`terms_input_user_interface(InputUser,Qv,ASub,Sg,MaybeCallASub)`

Obtains the abstract substitution ASub from user supplied information.

PREDICATEterms_asub_to_native/5

Usage:`terms_asub_to_native(ASub,Qv,OutFlag,OutputUser,Comps)`

Transforms abstract substitution ASub to user friendly format. Record relevant symbols for output if OutFlag is `yes`.

*The following properties should hold at call time:*

(`nonvar/1`)ASub is currently a term which is not a free variable.

(`nonvar/1`)Qv is currently a term which is not a free variable.

(`nonvar/1`)OutFlag is currently a term which is not a free variable.

(`var/1`)OutputUser is a free variable.

(`var/1`)Comps is a free variable.

PREDICATEterms_internal_to_native/3

No further documentation available for this predicate.

PREDICATEterms_output_interface/2

No further documentation available for this predicate.

PREDICATEterms_collect_auxinfo_asub/3

No further documentation available for this predicate.

PREDICATEterms_rename_auxinfo_asub/3

No further documentation available for this predicate.

PREDICATEterms_identical_abstract/2

No further documentation available for this predicate.

PREDICATEaidomain/1

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.init_abstract_domain/2

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.amgu/5

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.augment_asub/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.augment_two_asub/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.call_to_entry/10

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.exit_to_prime/8

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.project/6

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.widencall/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.needs/2

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.widen/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.compute_lub/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.compute_clauses_lub/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.compute_clauses_glb/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.fixpoint_covered/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.fixpoint_covered_gfp/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.identical_abstract/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.abs_sort/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.extend/6

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.less_or_equal/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.glb/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.eliminate_equivalent/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.abs_subset/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.call_to_success_fact/10

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.special_builtin/6

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.combined_special_builtin0/3

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.body_succ_builtin/9

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.split_combined_domain/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.success_builtin/7

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.call_to_success_builtin/7

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.obtain_info/5

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.input_interface/5

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.input_user_interface/6

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.asub_to_native/6

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.concrete/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.unknown_call/5

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.unknown_entry/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.empty_entry/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.part_conc/5

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.multi_part_conc/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.collect_auxinfo_asub/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.rename_auxinfo_asub/4

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.dom_statistics/2

No further documentation available for this predicate.
The predicate is *multifile*.

PREDICATEaidom.contains_parameters/2

No further documentation available for this predicate.
The predicate is *multifile*.

*Application modules:*`preprocess_flags`,`domains`,`p_unit`.*System library modules:*`sets`,`sort`,`messages`,`terms_vars`,`terms_check`,`lists`,`typeslib`,`assoc`.*Internal (engine) modules:*`term_basic`,`arithmetic`,`atomic_basic`,`basiccontrol`,`exceptions`,`term_compare`,`term_typing`,`debugger_support`,`basic_props`,`hiord_rt`.*Packages:*`prelude`,`initial`,`condcomp`,`assertions`,`assertions/assertions_basic`,`regtypes`,`basicmodes`,`aidomain`.

Generated with LPdoc using Ciao