We study matching-removability under the degree/connectivity regime of Halin's theorem, which asserts that every $k$-connected graph $G$ with minimum degree $δ(G)\ge k+1$ contains an edge $e$ such that $G-e$ remains $k$-connected. For $k,\ell\ge 1$, an $\ell$-matching is a matching of size $\ell$. A matching $M$ in a $k$-connected graph $G$ is {\it $k$-removable} if $G-M$ remains $k$-connected. We improve Halin's result by proving that every $k$-connected graph $G$ with $δ(G)\ge k+1$ contains a $k$-removable $2$-matching, except when $k=1$ and $G$ is a cycle. For small $k$ we obtain stronger bounds: (i) $k=1$: a 1-removable $\min\{\lfloor n/2\rfloor,δ(G)\}$-matching; (ii) $k=2$: a 2-removable $\lceil(δ(G)+1)/2\rceil$-matching, with a unique tight exception when $δ(G)$ is even and $G\cong K_{δ(G)+1}$; and (iii) $k=3$: for $δ(G)\ge 5$, a $3$-removable $\lceil(δ(G)+1)/2\rceil$-matching. All these bounds are optimal with respect to removable matching size and minimum degree. We also show that for every $n\ge 2δ$, there exists a $k$-connected $n$-vertex graph $G$ with minimum degree $δ$ that does not contain a $k$-removable matching of size at least $δ(G)+1$. Moreover, for $k\le 2$ there exists a $k$-removable $(δ(G)-c)$-matching for some $c\le 3$, which is optimal up to the additive constant.