In model-driven engineering, synchronization between models is important. One method of model synchronization is Bidirectional model transformation, which uses bidirectional transformation. It is based on round tripping properties and ensures consistency. In the bidirectional transformation language BiGUL, users can clarify essentialy ambiguous backward transformation using the putback-based approach, and since update propagation is performed on a state basis, processing speed improvements can also be expected through incrementalizing when handling large amounts of data. In this study, we have made the Haskell implementation of BiGUL update-based by adopting the generic type Val of the bidirectional transformation language X and the operation set Edit of the update-based bidirectional transformation language Edit Lenses. In this paper, we report our ongoing work on the semantics of the update-based BiGUL and the results of a performance evaluation conducted using benchmarks. The results confirmed that the update-based version achieved shorter processing times than the state-based version.