Expression Compatibility Problem

13 pages•Published: March 27, 2016

Abstract

We solve the Expression Compatibility Problem (ECP) – a variation of the famous Expression Problem (EP) which, in addition to the classical EP concerns, takes into consideration the replacement, refinement, and borrowing of algebraic datatype (ADT) cases. ECP describes ADT cases as components and promotes ideas from Lightweight Family Polymorphism, Class Sharing, and Expression Families Problem. Our solution is based on a formal model for Component-Based Software Engineering that pertains to the Expression Problem. We provide the syntax, static semantics, and dynamic semantics of
our model. We also show that our model can be used to solve the Expression Families
Problem as well. Moreover, we show how to embed the model in Scala.

Keyphrases: component based software engineering, expression compatibility problem, expression problem, formal semantics, lightweight family polymorphism

In: James H. Davenport and Fadoua Ghourabi (editors). SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science, vol 39, pages 55-67.

Links:	https://easychair.org/publications/paper/N5S
	https://doi.org/10.29007/xlbn

BibTeX entry

@inproceedings{SCSS2016:Expression_Compatibility_Problem,
  author    = {Seyed Hossein Haeri and Sibylle Schupp},
  title     = {Expression Compatibility Problem},
  booktitle = {SCSS 2016. 7th International Symposium on  Symbolic Computation in Software Science},
  editor    = {James H. Davenport and Fadoua Ghourabi},
  series    = {EPiC Series in Computing},
  volume    = {39},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/N5S},
  doi       = {10.29007/xlbn},
  pages     = {55-67},
  year      = {2016}}

Download PDF Open PDF in browser