A distributive lattice is an implicative lattice if besides the usual lattice-theoretic operations of meet and join, an auxiliary operation, the implication \(\to\), is given which is subject to equational conditions, like \(x\to (y\wedge y')= (x\to y)\wedge(x\to y')\), that generalize in an obvious way the Boolean case where \(x\to y=\neg x\vee y\), and where manipulations are carried out on the basis of the finite De Morgan laws. There is also a formal relation between \(l\)-groups and implicative lattices. The author is interested in Priestley spaces of implicative lattices and shows how to endow the Priestley spaces by an additional structure of two binary operations so that they correspond to implicative lattices.