09-28-2016, 07:41 PM

Hello Haskell is a functional language and has the option to define functions in prefix or infix notation, while that the hp-prime only prefix notation

PREFIX means the function name is before of the arguments

Example in prefix notation:

FUCTIONAME (arg1, arg2, argN) := expresion

ADDITION (X, Y) := X + Y // definition

ADDITION (3, 4)

returns 7

Infix means that the function name is between the arguments

Example:

arg1 FUCTIONAME arg2

X ADDITION Y: = X + Y

To denote that a function is in infix, HASKELL LANGUAGE use quotes inclined to the left ``

X `ADDITION` Y: = X + Y // definition

3 ADDITION 4

returns 7

This and similar to MODULO function

23 MOD 5

returns 3

For n arguments groups in parenthesis

(Arg1, arg2, argn) `FUCTIONAME` (arg1, arg2, argn) := ...

I think that the HP48 / 50 in SYSPRL can create this kind of infix functions,

can incorporate it into xcas?

the purpose is to create and writing functions nearest to math textbooks

PREFIX means the function name is before of the arguments

Example in prefix notation:

FUCTIONAME (arg1, arg2, argN) := expresion

ADDITION (X, Y) := X + Y // definition

ADDITION (3, 4)

returns 7

Infix means that the function name is between the arguments

Example:

arg1 FUCTIONAME arg2

X ADDITION Y: = X + Y

To denote that a function is in infix, HASKELL LANGUAGE use quotes inclined to the left ``

X `ADDITION` Y: = X + Y // definition

3 ADDITION 4

returns 7

This and similar to MODULO function

23 MOD 5

returns 3

For n arguments groups in parenthesis

(Arg1, arg2, argn) `FUCTIONAME` (arg1, arg2, argn) := ...

I think that the HP48 / 50 in SYSPRL can create this kind of infix functions,

can incorporate it into xcas?

the purpose is to create and writing functions nearest to math textbooks