<HTML> <HEAD> <!-- Created by texi2html 1.56k + clip patches and <A href="http://www.clip.dia.fi.upm.es/Software">lpdoc</A> from ciao.texi on 28 January 2007 --> <LINK rel="stylesheet" href="ciao.css" type="text/css"> <TITLE>The Ciao Prolog System - Miscellaneous ISO Prolog predicates</TITLE> </HEAD> <BODY> Go to the <A HREF="ciao_1.html">first</A>, <A HREF="ciao_41.html">previous</A>, <A HREF="ciao_43.html">next</A>, <A HREF="ciao_241.html">last</A> section, <A HREF="ciao_toc.html">table of contents</A>. <P><HR><P> <H1><A NAME="SEC216" HREF="ciao_toc.html#TOC216">Miscellaneous ISO Prolog predicates</A></H1> <P> <A NAME="IDX3021"></A> <P> <STRONG>Author(s):</STRONG> Daniel Cabeza. <P> <STRONG>Version:</STRONG> 1.10#7 (2006/4/26, 19:22:13 CEST) <P> <STRONG>Version of last change:</STRONG> 1.9#304 (2004/2/17, 17:20:4 CET) <P> This module implements some miscellaneous ISO Prolog predicates. <UL> <LI><A HREF="ciao_42.html#SEC217">Usage and interface (iso_misc)</A> <LI><A HREF="ciao_42.html#SEC218">Documentation on exports (iso_misc)</A> </UL> <H2><A NAME="SEC217" HREF="ciao_toc.html#TOC217">Usage and interface (<CODE>iso_misc</CODE>)</A></H2> <div class="cartouche"> <UL> <LI><STRONG>Library usage:</STRONG> <CODE>:- use_module(library(iso_misc)).</CODE> <LI><STRONG>Exports:</STRONG> <UL> <LI><EM>Predicates:</EM> <A NAME="IDX3022"></A> <CODE>\=/2</CODE>, <A NAME="IDX3023"></A> <CODE>once/1</CODE>, <A NAME="IDX3024"></A> <CODE>compound/1</CODE>, <A NAME="IDX3025"></A> <CODE>sub_atom/5</CODE>, <A NAME="IDX3026"></A> <CODE>unify_with_occurs_check/2</CODE>. </UL> <LI><STRONG>Other modules used:</STRONG> <UL> <LI><EM>System library modules:</EM> <A NAME="IDX3027"></A> <CODE>between</CODE>. </UL> </UL> </div class="cartouche"> <H2><A NAME="SEC218" HREF="ciao_toc.html#TOC218">Documentation on exports (<CODE>iso_misc</CODE>)</A></H2> <P> <A NAME="IDX3028"></A> <A NAME="IDX3029"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>\=/2:</B> <DD><A NAME="IDX3030"></A> <P> <CODE>X \= Y</CODE> <P> <CODE>X</CODE> and <CODE>Y</CODE> are not unifiable. </DL> <P> <A NAME="IDX3031"></A> <A NAME="IDX3032"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>once/1:</B> <DD><A NAME="IDX3033"></A> <P> <CODE>once(G)</CODE> <P> Finds the first solution of goal <CODE>G</CODE> (if any). <A NAME="IDX3034"></A> <CODE>once/1</CODE> behaves as <A NAME="IDX3035"></A> <CODE>call/1</CODE>, except that no further solutions are explored on backtracking. <P> <EM>Meta-predicate</EM> with arguments: <CODE>once(goal)</CODE>. </DL> <P> <A NAME="IDX3036"></A> <A NAME="IDX3037"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>compound/1:</B> <DD><A NAME="IDX3038"></A> <P> <CODE>compound(T)</CODE> <P> <CODE>T</CODE> is currently instantiated to a compound term. </DL> <P> <A NAME="IDX3039"></A> <A NAME="IDX3040"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>sub_atom/5:</B> <DD><A NAME="IDX3041"></A> <P> <CODE>sub_atom(Atom, Before, Length, After, Sub_atom)</CODE> <P> Is true iff atom <CODE>Atom</CODE> can be broken into three pieces, <CODE>AtomL</CODE>, <CODE>Sub_atom</CODE> and <CODE>AtomR</CODE> such that <CODE>Before</CODE> is the number of characters of the name of <CODE>AtomL</CODE>, <CODE>Length</CODE> is the number of characters of the name of <CODE>Sub_atom</CODE> and <CODE>After</CODE> is the number of characters of the name of <CODE>AtomR</CODE> </DL> <P> <A NAME="IDX3042"></A> <A NAME="IDX3043"></A> <DL> <DT><span class="define">PREDICATE:</span> <B>unify_with_occurs_check/2:</B> <DD><A NAME="IDX3044"></A> <P> <CODE>unify_with_occurs_check(X, Y)</CODE> <P> Attempts to compute and apply a most general unifier of the two terms <CODE>X</CODE> and <CODE>Y</CODE>. Is true iff <CODE>X</CODE> and <CODE>Y</CODE> are unifiable. </DL> <P><HR><P> Go to the <A HREF="ciao_1.html">first</A>, <A HREF="ciao_41.html">previous</A>, <A HREF="ciao_43.html">next</A>, <A HREF="ciao_241.html">last</A> section, <A HREF="ciao_toc.html">table of contents</A>. </BODY> </HTML>
