Here is an example of a dynamic module in MuPAD, with the 'magnum'
factorization program written by Wolfgang Roth <roth@math.uni-mannheim.de>.
First I got and installed the magnum library on my computer.
Then I wrote a C++ file <a href="magnum.c">magnum.c</a>. It defines a MuPAD
function magnum::factor that takes as input an univariate polynomial 
in list form as given by poly2list, and a prime number, and it returns
its factorization with polynomials in list form.
Because of a conflict with a gcc name in sys/types.h, 
I had to rename 'boolean' to 'mboolean' in all the MuPAD header files
(mmg/kernel/*.h).
Then I wrote a small <a href="makefile">makefile</a> to compile
magnum.c into a dynamic module magnum.mdm using the MuPAD module
generator 'mmg'.
Finally I wrote a small <a href="factor.mu">MuPAD function</a> that
factors a polynomial using the 'magnum' dynamic module.
As shown by the following <a href="session">session</a>, the resulting 
factorization program is very fast (about 5 to 10 times faster than Maple).
Here is the binary module obtained for <a href="magnum.mdm.gz">Sun/Solaris</a>.

Notes on installing magnum: (a) I had to rename 'min' into 'mmin' in
generic.H because of a conflict with an already defined macro;
(ii) on an HP, you may have to compile the library
with -O0 instead of -O2.