Logical Relations and Data Abstraction
Power, J. and Robinson, E., 2001. Logical Relations and Data Abstraction. In: Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings.Vol. 1862. Heidelberg: Springer, pp. 497-511.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
We prove, in the context of simple type theory, that logical relations are sound and complete for data abstraction as given by equational specifications. Specifically, we show that two implementations of an equationally specified abstract type are equivalent if and only if they are linked by a suitable logical relation. This allows us to introduce new types and operations of any order on those types, and to impose equations between terms of any order. Implementations are required to respect these equations up to a general form of contextual equivalence, and two implementations are equivalent if they produce the same contextual equivalence on terms of the enlarged language. Logical relations are introduced abstractly, soundness is almost automatic, but completeness is more difficult, achieved using a variant of Jung and Tiuryn’s logical relations of varying arity. The results are expressed and proved categorically.
|Item Type||Book Sections|
|Creators||Power, J.and Robinson, E.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)