Generalizing Semantic Bidirectionalization & Tracking Generated Expressions

Abstract

In programming, there are often pairs of functions running in opposite directions: the domain of one is the codomain of the other. Their functionalities are so closely related that it is possible to derive one from the implementation of the other. Bidirectionalization techniques address this concern. This thesis studies some of the theoretical and practical aspects of bidirectionalization. As the theoretical part of this thesis, we generalize an existing bidirectionalization technique, known as semantic bidirectionalization. Our generalized algorithm scales well and lifts some of the restrictions set by the original algorithm. As the practical part of this thesis, we focus on the problem of tracking expressions in the low-level generated code to their origins in the high-level code.