Go to the first, previous, next, last section, table of contents.

Basic data types and properties

Author(s): Daniel Cabeza, Manuel Hermenegildo.

Version: 1.10#6 (2004/8/7, 21:46:39 CEST)

Version of last change: 1.9#93 (2003/7/29, 17:53:15 CEST)

This library contains the set of basic properties used by the builtin predicates, and which constitute the basic data types and properties of the language. They can be used both as type testing builtins within programs (by calling them explicitly) and as properties in assertions.

Usage and interface (basic_props)

Documentation on exports (basic_props)

REGTYPE: term/1:

The most general type (includes all possible terms).

Usage: term(X)

REGTYPE: int/1:

The type of integers. The range of integers is [-2^2147483616, 2^2147483616). Thus for all practical purposes, the range of integers can be considered infinite.

Usage: int(T)

REGTYPE: nnegint/1:

The type of non-negative integers, i.e., natural numbers.

Usage: nnegint(T)

REGTYPE: flt/1:

The type of floating-point numbers. The range of floats is the one provided by the C double type, typically [4.9e-324, 1.8e+308] (plus or minus). There are also three special values: Infinity, either positive or negative, represented as 1.0e1000 and -1.0e1000; and Not-a-number, which arises as the result of indeterminate operations, represented as 0.Nan

Usage: flt(T)

REGTYPE: num/1:

The type of numbers, that is, integer or floating-point.

Usage: num(T)

REGTYPE: atm/1:

The type of atoms, or non-numeric constants. The size of atoms is unbound.

Usage: atm(T)

REGTYPE: struct/1:

The type of compound terms, or terms with non-zeroary functors. By now there is a limit of 255 arguments.

Usage: struct(T)

REGTYPE: gnd/1:

The type of all terms without variables.

Usage: gnd(T)

REGTYPE: constant/1:

Usage: constant(T)

REGTYPE: callable/1:

Usage: callable(T)

REGTYPE: operator_specifier/1:

The type and associativity of an operator is described by the following mnemonic atoms:

Infix, non-associative: it is a requirement that both of the two subexpressions which are the arguments of the operator must be of lower precedence than the operator itself.
Infix, right-associative: only the first (left-hand) subexpression must be of lower precedence; the right-hand subexpression can be of the same precedence as the main operator.
Infix, left-associative: same as above, but the other way around.
Prefix, non-associative: the subexpression must be of lower precedence than the operator.
Prefix, associative: the subexpression can be of the same precedence as the operator.
Postfix, non-associative: the subexpression must be of lower precedence than the operator.
Postfix, associative: the subexpression can be of the same precedence as the operator.

Usage: operator_specifier(X)

REGTYPE: list/1:

A list is formed with successive applications of the functor '.'/2, and its end is the atom []. Defined as

list([_1|L]) :-

Usage: list(L)

REGTYPE: list/2:

list(L, T)

L is a list, and for all its elements, T holds.

Meta-predicate with arguments: list(?,pred(1)).

Usage: list(L, T)

PROPERTY: member/2:

Usage: member(X, L)

REGTYPE: sequence/2:

A sequence is formed with zero, one or more occurrences of the operator ','/2. For example, a, b, c is a sequence of three atoms, a is a sequence of one atom.

Meta-predicate with arguments: sequence(?,pred(1)).

Usage: sequence(S, T)

REGTYPE: sequence_or_list/2:

Meta-predicate with arguments: sequence_or_list(?,pred(1)).

Usage: sequence_or_list(S, T)

REGTYPE: character_code/1:

Usage: character_code(T)

REGTYPE: string/1:

A string is a list of character codes. The usual syntax for strings "string" is allowed, which is equivalent to [0's,0't,0'r,0'i,0'n,0'g] or [115,116,114,105,110,103]. There is also a special Ciao syntax when the list is not complete: "st"||R is equivalent to [0's,0't|R].

Usage: string(T)

REGTYPE: predname/1:

Usage: predname(P)

REGTYPE: atm_or_atm_list/1:

Usage: atm_or_atm_list(T)

PROPERTY: compat/2:

This property captures the notion of type or property compatibility. The instantiation or constraint state of the term is compatible with the given property, in the sense that assuming that imposing that property on the term does not render the store inconsistent. For example, terms X (i.e., a free variable), [Y|Z], and [Y,Z] are all compatible with the regular type list/1, whereas the terms f(a) and [1|2] are not.

Meta-predicate with arguments: compat(?,pred(1)).

Usage: compat(Term, Prop)

PROPERTY: iso/1:

Usage: iso(G)

PROPERTY: not_further_inst/2:

Usage: not_further_inst(G, V)

PROPERTY: sideff/2:

sideff(G, X)

Declares that G is side-effect free, soft (do not affect execution, e.g., input/output), or hard (e.g., assert/retract).

Meta-predicate with arguments: sideff(goal,?).

General properties: sideff(G, X)

sideff(G, X)

Usage: sideff(G, X)

PROPERTY: regtype/1:

Meta-predicate with arguments: regtype(goal).

Usage: regtype(G)

PROPERTY: native/1:

Meta-predicate with arguments: native(goal).

Usage: native(Pred)

PROPERTY: native/2:

Meta-predicate with arguments: native(goal,?).

Usage: native(Pred, Key)

Go to the first, previous, next, last section, table of contents.