Algebraic specifications for datatypes are shown to be easy to write if succinct implementation descriptions are available. The method proposed solves out the implementation details, leaving behind the specification required. A number of examples illustrate the method. However it is also shown that in general the solution is not algorithmic. A connection to the correctness problem for implementations is made.