ORDER-SORTED ALGEBRA SOLVES THE CONSTRUCTOR-SELECTOR, MULTIPLE REPRESENTATION AND COERCION PROBLEMS.

Joseph A. Goguen, Jose Meseguer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Structured data are generally composed from constituent parts by constructors and decomposed by selectors. The authors prove that the usual many-sorted algebra approach to abstract data types cannot capture the simple intuition in a satisfactory way. They also show that order-sorted algebra does solve this problem, and many others concerning ill-defined and erroneous expressions, in a simple and natural way. In particular, they show how order-sorted algebra supports an elegant solution to the problems of multiple representations and coercions. The essence of order-sorted algebra is that sorts have subsorts, whose semantic interpretation is the subset relation on the carriers of algebras.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages18-29
Number of pages12
ISBN (Print)0818607939
StatePublished - Jan 1 1987
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'ORDER-SORTED ALGEBRA SOLVES THE CONSTRUCTOR-SELECTOR, MULTIPLE REPRESENTATION AND COERCION PROBLEMS.'. Together they form a unique fingerprint.

  • Cite this