LP structures on type lattices and some refactoring problems

Abstract

Lattice-based algebraic structures containing semantics of production-logic inference on a type hierarchy in an object-oriented system with an additional relation are introduced. Specific features of these structures, such as closedness, possibility of equivalent transformations, existence of logical reduction, are studied. It is shown how to apply the model developed to verification and optimization of type hierarchies. An important direction of the optimization is automatic elimination of code duplication by “pulling up” common attributes in the type hierarchy. Implementation issues are briefly discussed.

Identifiers

DOI

10.1134/s0361768809040021

Citations and references