Interpolation for predefined types

Răzvan Diaconescu · Mathematical Structures in Computer Science · 2011

We give a logic-independent semantics for predefined (data) types within the categorical abstract model theoretic framework of the theory of institutions. We develop a generic interpolation result for this semantics, which can be easily applied to various concrete situations from the theory and practice of specification and programming. Our study of interpolation is motivated by a number of important applications to computing science, especially in the area of structured specifications.

Read the paper · More papers on PaperTik