# How to proof HALT doesn't reduce to L?

What method(s) can I use in general to proof HALT doesn't reduce to given language?

Mostly, show that $L$ is decidable, mostly by designing an algorithm to decide it.