Full abstraction and limiting completeness in equational languages (Q1121676)

A notion of full abstraction for equational languages is introduced by the author. That notion has the property that each language has a unique fully abstract model which can be characterized as the final object on a suitable category of computable models. The author also describes two different techniques for proving limiting completeness with respect to regular systems à la Hoffmann-O'Donnell and to information systems à la Dana Scott.