Fully abstract compositional semantics for logic programs
Haim Gaifman, Ehud Y. Shapiro · 1989
We propose a framework for discussing fully abstract compositional semantics, which exposes the interrelations between the choices of observables, compositions, and meanings. Every choice of observables and compositions determines a unique fully abstract equivalence. A semantics is fully abstract if it induces this equivalence.