Representation theorem for Complete Atomic Heyting Algebras It is well known that within classical logic one can characterize complete atomic boolean algebras as powersets.

Is it possible to provide any characterization/representation theorem for complete atomic heyting algebras?

Edit.
After some very constructive considerations in the comments I discovered that I am interested in an unusual notion of atom. Since the question turned out to be interesting also for people outside my mathematical comfort zone, I will write below two different definitions of atom and I would like to have an answer to my question for both definitions.
Atom (2) is the usual notion of atom, atom (1) should be called infinitary join-irreducible or tiny element.
A discussion that relates the two concepts can be found here as proposition 5.1. In boolean algebras these two definitions coincide.

Some definitions.
Def. In a complete poset $\mathbb{P}$ an atom (1) is an element $p$ such that $$\text{if } p \leq \bigvee_{i \in I} a_i \text{ then } p \leq a_j \text{ for some } j \in I. $$
Def. In a poset $\mathbb{P}$ an atom (2) is a minimal nonzero element.
Def. A subset $A$ of a complete poset  $\mathbb{P}$ is (join-)dense if for each element $p$ there is a family of $(a_i)$ in A such that $$p = \bigvee a_i. $$
Def. A complete poset is atomic if the set of its atoms is dense.
 A: Definition atom (1) is commonly referred to in literature as completely join-prime elements, and in the case of completely distributive complete lattices coincide with the completely join-irreducible elements (as amrsa points out in the comments).
The complete distributive lattices whose completely join-irreducible elements join generate  the lattice (i.e. the set of completely join-irreducibles is dense) are referred to by Gehrke, Nagahashi and Venema in "A Sahlqvist theorem for distributive modal logic" as perfect lattices (this is definition 2.14, if you cannot access the paper let me know and I can send it to you). There they also state a characterization which is very much in style of the powerset characterization for Boolean algebras. Namely, perfect lattices correspond to the set of downsets of a partial order. 
Definition atom (2) is closer to the meaning of atom. If these atoms join generate the Heyting algebra then it's not hard to see that the completely distributive lattice is in fact a Boolean algebra. Indeed, let $\mathbb{A}$ be a completely distributive lattice that is join-generated by its atoms. Let $X$ be the set of atoms. Let $a\in\mathbb{A}$ and let $Y\subseteq X$ such that $\bigvee Y=a$. For every $b\in X\setminus Y$ we have that $a\land b=\bot$. Therefore
$$a\to\bot=\bigvee\{b\in\mathbb{A}\mid a\land b\leq \bot\}\geq\bigvee(X\setminus Y).$$
Hence $a\lor (a\to\bot)=\bigvee X=\top$, i.e. the law of excluded middle holds.
