Author(s): Francisco Bueno.
Version: 1.7#208 (2002/4/23, 19:9:14 CEST)
Version of last change: 1.7#167 (2002/1/3, 17:43:50 CET)
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.)
:- use_module(library('assertions/meta_props'))or also as a package
:- use_package(metaprops). Note the different names of the library and the package.
A has property
P (provided that
P is a property). Equivalent to
Pis a term which represents a goal, i.e., an atom or a structure. (
^ (callable;prop_abs). (
Ais of type
^ (regtype;prop_abs). (
(User defined.) A hook predicate you have to define as
callme(P,X):- P(X), !. in the program that uses this library. This is done automatically if the package is used instead of the library module (but then you should not define
callme/2 in your program).
The predicate is multifile.
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:
denotes terms of the form
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).
Go to the first, previous, next, last section, table of contents.