Sorry, I thought it was pretty clear but the threads are long now. We need to capture the literal 2 and make it Literal(2). But then the issue is that we want Literal{T} <: T semantics. I.e. in promote_type it should use the promotions of T to build the value that is finally used in its rule applications or in its generated code. But not just promote_type, but every function. Without Literal{T} <: T semantics, that would require the symbolic library mimics promote_type, sin, and etc. dispatches of every number type, which then would mean we only would support Literal{T} for chosen types. So for now you can create the number with the type that you want, i.e. Term(sqrt,[big(2)]) and when the whole Sym{T} <: T passes are working Literal will just be a new istree under the same semantics and that would do this automatically.
Sym{T} <: T of course has been talked about at length on these forums and elsewhere with the solution to be to build it in the tracing environment. We just need to make any type satisfying some trait be captured to automatically have these semantics.