This paper investigates the techniques to generate efficient code from abstract programs with abstract data types. Two techniques are used to generate efficient code. The first one is based on the properties derived through data-flow analysis to generate efficient code. The second one is based on element, which is an abstract data type and declares a variable belonging to an existing container. These techniques are used to choose efficient implementations for ADTs operations and to avoid data structure copies. To demonstrate these techniques, SimpleL, a small high level language is used in this paper. This language supports abstract data types including finite set, finite list and finite map. One can specify the data structures to implement these abstract types.