This library allows the use of some meta-constructs which provide for specifying properties of terms which are unknown at the time of the specification, or expressed with a shorthand for the property definition, i.e., without really defining it.
An example of such use is an assertion which specifies that any property holding upon call will also hold upon exit:
:- pred p(X) : Prop(X) => Prop(X).
Another example is using shorthands for properties when documenting:
:- pred p(X) : regtype(X,(^(list;list);list)).
(See below for an explanation of such a regular type.)
A has property P (provided that P is a property). Equivalent to P(A).
Usage:call(P,A)
A has property P.
Usage:prop(A,P)
A has property P.
Usage:regtype(A,T)
A is of type T.
Usage:callme(A,B)
Prop is a property abstraction, i.e., a parametric property, or a term formed of property abstractions, where the functors used in the term are escaped by ^.
One particular case of property abstractions are parametric regular type abstractions, i.e., a parametric type functor or a ^-escaped term formed of regular type abstractions.
Such abstractions are a short-hand for a corresponding regular type (correspondingly, property). For example, the following abstraction:
^(list;list);listdenotes terms of the form (X;Y) where list(X) and list(Y) hold and also terms T such that list(T) holds. It is equivalent to the regular type:
abstract_type((X;Y)):- list(X), list(Y). abstract_type(T):- list(T).
Usage:prop_abs(Prop)
Prop is a property abstraction.