Improve stack effect notation?

[frno7]

Standard stack effect notation with suffixed types is somewhat undescriptive and less readable than desired. For example, the standard declaration of the extended Euclidean algorithm is:

\ Extended greatest common divisor.  Bézout’s identity n1·n3 + n2·n4 = n5 holds.
: extended-gcd ( n1 n2 -- n3 n4 n5 )

Can the parameter names be improved in some standard way? For example (nonstandard):

\ Extended greatest common divisor. Bézout’s identity p·m + q·n = d holds.
: extended-gcd ( p q -- m n d )