User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Expression Compatibility Problem

Primary tabs

download
  • Open access
  • PDF
  • 490.33 K
Haeri, Seyed Hossein [UCL] Schupp, Sibylle [Hamburg University of Technology, Germany]

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 (EFP). Our solution is based on a formal model for Component-Based Software Engineering that pertains to EP. We provide the syntax, static semantics, and dynamic semantics of our model. We also show that our model solves EFP as well. Moreover, we show how to embed the model in Scala.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès libre
Publication date 2016
Language Anglais
Conference "7th International Symposium on Symbolic Computation in Software Science (SCSS 2016)", Tokyo, Japan (du 28/03/2016 au 31/01/2017)
Peer reviewed yes
Publication status Publié
Affiliations UCL - Autre
UCL - SST/ICTM/INGI - Pôle en ingénierie informatique
Keywords Expression Problem ; Expression Families Problem ; Lightweight Family Polymorphism ; Component-Based Software Engineering
Links
Bibliographic reference Haeri, Seyed Hossein ; Schupp, Sibylle. Expression Compatibility Problem.7th International Symposium on Symbolic Computation in Software Science (SCSS 2016) (Tokyo, Japan, du 28/03/2016 au 31/01/2017).
Permanent URL http://hdl.handle.net/2078/181932