gcd of polynomials with Complex coefficient (should it fail?)

[shashi]

julia> using DynamicPolynomials

julia> @polyvar a b
(a, b)

julia> julia> gcd(im*a, a)
ERROR: MethodError: no method matching gcd(::Complex{Bool}, ::Complex{Bool})
Closest candidates are:
  gcd(::AbstractPolynomialLike, ::Any) at /home/shashi/.julia/dev/MultivariatePolynomials/src/gcd.jl:50
  gcd(::AbstractPolynomialLike, ::Any, ::MultivariatePolynomials.AbstractUnivariateGCDAlgorithm) at /home/shashi/.julia/dev/MultivariatePolynomials/src/gcd.jl:50
  gcd(::Any, ::AbstractPolynomialLike) at /home/shashi/.julia/dev/MultivariatePolynomials/src/gcd.jl:49
  ...
Stacktrace:
  [1] promote_operation_fallback(op::typeof(gcd), #unused#::Type{Complex{Bool}}, #unused#::Type{Complex{Bool}})
    @ MutableArithmetics ~/.julia/packages/MutableArithmetics/8xkW3/src/interface.jl:20
  [2] promote_operation(::Function, ::Type, ::Type)
    @ MutableArithmetics ~/.julia/packages/MutableArithmetics/8xkW3/src/interface.jl:58

It would make generic downstream code so much easier to write even if this returned 1...

[shashi]

In general, what is a good way to call GCD between two Polynomials only when it's going to work?