Return to longname.rr CVS log

Up to [local] / OpenXM / src / asir-contrib / packages / src

Renaming:
  dsolv --> dsolv.rr
  gnuplot --> gnuplot.rr
  longname --> longname.rr
  m       --> mathematica.rr
  om      --> om.rr
  phc     --> phc.rr
  sm1     --> sm1.rr
  tigers  --> tigers.rr

/* $OpenXM: OpenXM/src/asir-contrib/packages/src/longname.rr,v 1.1 2005/04/08 05:56:47 takayama Exp $ */
/* Old: longname, see Attic */ 
/*&C

*/
/*&en 
@node OpenMath Function Names,,, Top
@chapter OpenMath Function Names (Version in 1999)
@menu
* OpenMath Function Names::
@end menu
@node OpenMath,,, OpenMath Function Names
@subsection @code{OpenMath} CD Basic
@findex OpenMath
@table @t
@item OpenMath Function Names
::     Asir/OpenXM supports 
   function names in function names following OpenMath
   Content Dictionaries (Version in 1999). 
@end table

*/

/*&ja 
@node OpenMath Function Names,,, Top
@chapter OpenMath Function Names (1999 $BHG(B)
@menu
* OpenMath Function Names::
@end menu
@node OpenMath,,, OpenMath $BH!?tL>(B
@subsection @code{OpenMath} CD Basic
@findex OpenMath
@table @t
@item OpenMath Function Names
::   Asir/OpenXM (OpenXM $BBP1~$N(B asir) $B$O(B
    OpenMath $B$N(B Content Dictionaries (1999 $BHG(B) $B$KBP1~$7$?(B,
   $B0J2<$NH!?tL>$r%5%]!<%H$9$k(B.
@end table
 */

/*&C

@example
Basic_Pi = @@pi $
Basic_true = 1$
Basic_false = 0$
Basic_e = @@e$
def basic_plus(A,B) @{ return(A+B); @}
def basic_times(A,B) @{ return(A*B); @}
def basic_minus(A,B) @{ return(A-B); @}
def basic_over(A,B) @{ return(A/B); @}
def basic_power(A,B) @{ return(A^B); @}
def basic_and(A,B)   @{ return(A && B); @}
def basic_or(A,B)    @{ return(A || B); @}
def basic_not(A)   @{ return(! A); @}
def basic_IntegerQuotient(A,B) @{ return(idiv(A,B)); @}
def basic_IntegerRemainder(A,B) @{ return(irem(A,B)); @}
def basic_IntegerGcd(A,B)  @{ return(igcd(A,B)); @}
def basic_exp(A)           @{ return(exp(A)); @}
def basic_ln(A)            @{ return(log(A)); @}
def basic_sin(A)           @{ return(sin(A)); @}
def basic_cos(A)           @{ return(cos(A)); @}
def basic_tan(A)           @{ return(tan(A)); @}
def basic_diff(A,B)        @{ return(diff(A,B)); @}
def basic_equal(A,B)       @{ return( A == B); @}
def basic_unequal(A,B)     @{ return( A != B); @}
def basic_less(A,B)        @{ return( A < B); @}
def basic_lessequal(A,B)        @{ return( A <= B); @}
def basic_greater(A,B)        @{ return( A > B); @}
def basic_greaterequal(A,B)        @{ return( A >= B); @}
def basic_select(A,B)         @{ return(A[B]); @}
def basic_length(A)           @{ if (type(A)==4) return(length(A)); 
                                else return(size(A)[0]); @}
Poly_lexicogrpahic = 2$
Poly_gradedLexicographic = 1$
Poly_gradedReverseLexicographic = 0$
def poly_degreeWrt(A,B)       @{ return(deg(A,B)); @}
def poly_resultant(A,B,V) @{ return(res(V,A,B)); @}
def poly_groebner(O,P,V)  @{ return(gr(P,V,O)); @}
def poly_hilbert_polynomial(I)  @{ return(taka_poly_hilbert_polynomial(I)); @}

@end example
*/

/* Double check the names */
Basic_Pi = @pi $
Basic_true = 1$
Basic_false = 0$
Basic_e = @e$
def basic_plus(A,B) { return(A+B); }
def basic_times(A,B) { return(A*B); }
def basic_minus(A,B) { return(A-B); }
def basic_over(A,B) { return(A/B); }
def basic_power(A,B) { return(A^B); }
def basic_and(A,B)   { return(A && B); }
def basic_or(A,B)    { return(A || B); }
def basic_not(A)   { return(! A); }
def basic_IntegerQuotient(A,B) { return(idiv(A,B)); }
def basic_IntegerRemainder(A,B) { return(irem(A,B)); }
def basic_IntegerGcd(A,B)  { return(igcd(A,B)); }
def basic_exp(A)           { return(exp(A)); }
def basic_ln(A)            { return(log(A)); }
def basic_sin(A)           { return(sin(A)); }
def basic_cos(A)           { return(cos(A)); }
def basic_tan(A)           { return(tan(A)); }
def basic_diff(A,B)        { return(diff(A,B)); }
/* basic_int(A,B), basic_defint(A,B) have not been implemented. */
def basic_equal(A,B)       { return( A == B); }
def basic_unequal(A,B)     { return( A != B); }
def basic_less(A,B)        { return( A < B); }
def basic_lessequal(A,B)        { return( A <= B); }
def basic_greater(A,B)        { return( A > B); }
def basic_greaterequal(A,B)        { return( A >= B); }
def basic_select(A,B)         { return(A[B]); }
def basic_length(A)           { if (type(A)==4) return(length(A)); 
                                else return(size(A)[0]); }
Poly_lexicogrpahic = 2$
Poly_gradedLexicographic = 1$
Poly_gradedReverseLexicographic = 0$
def poly_degreeWrt(A,B)       { return(deg(A,B)); }
/* poly_lcm(A,B) */
def poly_resultant(A,B,V) { return(res(V,A,B)); }
def poly_groebner(O,P,V)  { return(gr(P,V,O)); }

/*
&en

It is convinient to have function names without basic_ etc.

&ja

basic_ $B$J$I$,$D$+$J$$$D$.$N$h$&$JH!?tL>$bEPO?$7$F$"$k(B.



&C 

@example

def factor(F) @{ return(poly_factor(F)); @}
def cancel(F)  @{ return(red(F)); @}
def numerator(F) @{ return(nm(F)); @}
def denominator(F) @{ return(dn(F)); @}
def hilbert_polynomial(G,V) @{
     A=gr(G,V,0); B=map(dp_ht,map(dp_ptod,A,V));
     C=map(dp_dtop,B,V);
     return(sm1_hilbert([C,V]));
@}

@end example
*/

/*
def factor(F) { return(poly_factor(F)); }
def cancel(F)  { return(red(F)); }
def numerator(F) { return(nm(F)); }
def denominator(F) { return(dn(F)); }
*/

def hilbert_polynomial(G,V) {
     A=gr(G,V,0); B=map(dp_ht,map(dp_ptod,A,V));
     C=map(dp_dtop,B,V);
     return(sm1_hilbert([C,V]));
}


/*&C

*/
end$