Yes, but viewing invariants and coinvariants as $R$-modules seems "right" because they're limits of the representation viewed as a functor $\mathbf BG\to \!\!\;_R\mathsf{Mod}$
@Arrow I think from a module perspective, viewing them as $R[G]$-modules is also natural: one is the largest submodule with a trivial action and the other is the largest quotient with a trivial action. In representation theory, it is important to work with the trivial representation as a representation and not just a vector space
@MatheinBoulomenos actually it seems that plugging $Y=X^G$ into here might give what's needed: $\!\!\;_{R}\mathsf{Mod}(X_{G},X^G) \cong \!\!\;_{R[G]}\mathsf{Mod}(X, \varepsilon ^\ast R\otimes _R X^G)) .$
you have a correspondence between elements of the form $e^{\frac{s}{\log x}}$ and real numbers $s$
in such a way that
if you take two real numbers $s_1$ and $s_2$ and add them in $\Bbb R$ you get $s_1 + s_2$
and then using the map $e^{\frac{\cdot }{\log x}}$ you get $e^{\frac{s_1 + s_2}{\log x}}$
but you could've started with $s_1$ and $s_2$ separately
used the map $e^{\frac{\cdot}{\log x}}$ and got $e^{\frac{s_1}{\log x}}$ and $e^{\frac{s_2}{\log x}}$ and then composed these and get the same answer $e^{\frac{s_1 + s_2}{\log x}}$
Yus, you have a group $G_1 = \lbrace e^{\frac{s}{\log x}} : s \in \Bbb R \rbrace$ where the composition law is given by multiplication, the identity is $1$, the inverses are the ones you mentioned earlier
and associativity holds because associativity has never not held
but the point I'm making is that this is basically the same as $(\Bbb R, +)$ with different notation
I should go to bed, hopefully my explanation wasn't too bad. I'd recommend reading up on group theory if you're interested; I was talking about group isomorphisms here.
A real mathematician might be able to help you some more!