Integration of a Decentralised Pattern Matching: Venue for a New Paradigm Intermarriage

13 pages•Published: March 26, 2017

Abstract

We provide a new technique for pattern matching that is based on components for each match. The set of match statements and their order is open for configuration at the right time and takes place in a feature-oriented fashion. This gives rise to a solution to the Expression Problem in presence of defaults. It takes a lightweight discipline to develop components for our technique. Their use for configuration of the pattern match, however, is virtually automatic.

Keyphrases: component based software engineering, expression problem, feature oriented programming

In: Mohamed Mosbah and Michael Rusinowitch (editors). SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017, vol 45, pages 16-28.

Links:	https://easychair.org/publications/paper/gRK
	https://doi.org/10.29007/k919

BibTeX entry

@inproceedings{SCSS2017:Integration_Decentralised_Pattern_Matching,
  author    = {Seyed Hossein Haeri and Sibylle Schupp},
  title     = {Integration of a Decentralised Pattern Matching: Venue for a New Paradigm Intermarriage},
  booktitle = {SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017},
  editor    = {Mohamed Mosbah and Michael Rusinowitch},
  series    = {EPiC Series in Computing},
  volume    = {45},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/gRK},
  doi       = {10.29007/k919},
  pages     = {16-28},
  year      = {2017}}

Download PDF Open PDF in browser