The paper presents the implementation of an extension of the LISPKIT LISP-language version ARL by the following primitive generalized functions of the standard LI SP-language: \begin{itemize} ıem[] (PLUS $i1\ \dots\ ik$) $k>=1$ ıem[] (TIMES $i1\ \dots\ ik$) ıem[] (OR $\ell1\ \dots\ \ell k$) ıem[] (AND $\ell1\ \dots\ \ell k$) ıem[] (COND $(\ell1\ e1)\ \dots\ (\ell k\ ek)$) \end{itemize} $ik,\dots,ik$ are integer well-formed expressions, $\ell1,\dots,\ell k$ are logical well-forsied expressions, $e1,\dots,ek$ are arbitrary well-formed expressions, and their degenerated cases: \begin{itemize} ıem[] (PLUS) ıem[] (TIMES) ıem[] (OR) ıem[] (AND) ıem[] (COND) \end{itemize} in an indirect and direct way. The Implementation was performed in the LISPKIT LISP-language version ARL.