Author(s): Daniel Cabeza.
Version: 1.10#6 (2004/8/7, 21:46:39 CEST)
Version of last change: 1.9#304 (2004/2/17, 17:20:4 CET)
This module implements some miscellaneous ISO Prolog predicates.
X \= Y
Y are not unifiable.
Finds the first solution of goal
G (if any).
once/1 behaves as
call/1, except that no further solutions are explored on backtracking.
Meta-predicate with arguments:
T is currently instantiated to a compound term.
sub_atom(Atom, Before, Length, After, Sub_atom)
Is true iff atom
Atom can be broken into three pieces,
AtomR such that
Before is the number of characters of the name of
Length is the number of characters of the name of
After is the number of characters of the name of
Attempts to compute and apply a most general unifier of the two terms
Y. Is true iff
Y are unifiable.
Go to the first, previous, next, last section, table of contents.