In this paper we study proof theory for the first constructive version of hybrid logic called IHL. In this perspective we propose a sequent-style natural deduction system and then the first sequent calculus for IHL. In addition to soundness and completeness, we show that this calculus has the cut-elimination property. Finally, we give the first decision procedure for IHL, that is based on this calculus, and therefore we prove its decidability.