A reduction of $HALT_{TM}$ to $A_{TM}$
A many-one reduction from $HALT_{TM}$ to $A_{TM}$ means that all instances of the $HALT_{TM}$ problem are transformed to an instance of $A_{TM}$ (can be just one instance), such that if $A_{TM}$ is turing-recognizable then $HALT_{TM}$ is also turing-recognizable.

This reduction can be done by encoding a $TM$ $N$, such that $N$ accepts input string $\langle M,w\rangle$ iff $M$ halts with input string $w$. So if $M$ halts with input $w$, it means that $\langle M,w\rangle \in HALT$, which implies that $N$ accepts $\langle M,w\rangle$, and that the instance $\langle N,\langle M,w\rangle\rangle\in A_{TM}$.