Ralf Hemmecke <[EMAIL PROTECTED]> writes: > On 05/15/2008 11:27 AM, Martin Rubey wrote: > > Thanks to Gaby, I was looking at the micro-semantics of the loop in the > > following: > > > > lift?(p1:SUPP,p2:SUPP,uterm:UTerm,ldeg:List NNI, > > lvar:List OV) : > > Union(s:SUPP,failed:"failed",notCoprime:"notCoprime") == > > leadpol:Boolean:=false > > (listpol,lval):=(uterm.lpol,uterm.lint.first) > > d:=listpol.first > > listpol:=listpol.rest > > nolift:Boolean:=true > > for uf in listpol repeat > > --note uf and d not necessarily primitive > > degree gcd(uf,d) =0 => nolift:=false > > Note, that "=>" does *not* break out of the loop.
You should have tries TEST Martin ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2008. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ open-axiom-devel mailing list open-axiom-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/open-axiom-devel
