The package implements triangular decompositions in two restricted cases:
(1) "Monomial" => M2 implementation for monomial ideals
(2) "Binomial" => M2 implementation for binomial ideals
For arbitrary ideals we interface to Maple:
(3) "Maple" => uses library RegularChains (included in Maple)
(4) "Epsilon" => uses Maple's package Epsilon (download from http://www-polsys.lip6.fr/~wang/epsilon/)
The object TriangularDecompAlgorithm is a symbol.