Summary: In the present paper, we develop the algorithmic correspondence theory for hybrid logic with binder \(\mathcal{H}(@,\downarrow)\). We define the class of Sahlqvist inequalities for \(\mathcal{H}(@,\downarrow)\), and each inequality of which is shown to have a first-order frame correspondent effectively computable by an algorithm \(\mathsf{ALBA}^{\downarrow}\).