  We introduce an algorithm for computing closure systems derived from a family
of implications on a set. Semilattices presentations are explored and used in
conjunction with the algorithm to compute various types of lattices freely
generated by partially ordered sets within four easy varieties.
