Difference between revisions of "Publications/geraud.00.europlop"
From LRDE
Line 12: | Line 12: | ||
| abstract = This pattern faces the problem of improving the performances of design patterns when they are involved in intensive algorithms. Generic programming is a paradigm in which most classes and procedures are parameterized, thus leading to the construction of general and efficient software components. We demonstrate that some design patterns from Gamma et al. can be translated into this paradigm while handling operation polymorphism by parametric polymorphism. We thus preserve their modularity and reusability properties but we avoid the performance penalty due to their dynamic behavior, which is a critical issue in numerical computing. |
| abstract = This pattern faces the problem of improving the performances of design patterns when they are involved in intensive algorithms. Generic programming is a paradigm in which most classes and procedures are parameterized, thus leading to the construction of general and efficient software components. We demonstrate that some design patterns from Gamma et al. can be translated into this paradigm while handling operation polymorphism by parametric polymorphism. We thus preserve their modularity and reusability properties but we avoid the performance penalty due to their dynamic behavior, which is a critical issue in numerical computing. |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/europlop00.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/europlop00.pdf |
||
+ | | lrdekeywords = Software engineering |
||
| type = inproceedings |
| type = inproceedings |
||
| id = geraud.00.europlop |
| id = geraud.00.europlop |
||
Line 38: | Line 39: | ||
and reusability properties but we avoid the performance |
and reusability properties but we avoid the performance |
||
penalty due to their dynamic behavior, which is a critical |
penalty due to their dynamic behavior, which is a critical |
||
− | issue in numerical computing.<nowiki>}</nowiki> |
+ | issue in numerical computing.<nowiki>}</nowiki>, |
+ | lrdekeywords = <nowiki>{</nowiki>Software engineering<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Revision as of 18:07, 4 November 2013
- Authors
- Thierry Géraud, Alexandre Duret-Lutz
- Where
- Proceedings of the 5th European Conference on Pattern Languages of Programs (EuroPLoP)
- Place
- Irsee, Germany
- Type
- inproceedings
- Publisher
- UVK, Univ. Verlag, Konstanz
- Keywords
- Software engineering
- Date
- 2000-07-01
Abstract
This pattern faces the problem of improving the performances of design patterns when they are involved in intensive algorithms. Generic programming is a paradigm in which most classes and procedures are parameterized, thus leading to the construction of general and efficient software components. We demonstrate that some design patterns from Gamma et al. can be translated into this paradigm while handling operation polymorphism by parametric polymorphism. We thus preserve their modularity and reusability properties but we avoid the performance penalty due to their dynamic behavior, which is a critical issue in numerical computing.
Documents
Bibtex (lrde.bib)
@InProceedings{ geraud.00.europlop, author = {Thierry G\'eraud and Alexandre Duret-Lutz}, title = {Generic programming redesign of patterns}, booktitle = {Proceedings of the 5th European Conference on Pattern Languages of Programs (EuroPLoP)}, year = 2000, month = jul, address = {Irsee, Germany}, pages = {283--294}, editors = {M. Devos and A. R\"uping}, publisher = {UVK, Univ. Verlag, Konstanz}, project = {Software}, abstract = {This pattern faces the problem of improving the performances of design patterns when they are involved in intensive algorithms. Generic programming is a paradigm in which most classes and procedures are parameterized, thus leading to the construction of general and efficient software components. We demonstrate that some design patterns from Gamma et al. can be translated into this paradigm while handling operation polymorphism by parametric polymorphism. We thus preserve their modularity and reusability properties but we avoid the performance penalty due to their dynamic behavior, which is a critical issue in numerical computing.}, lrdekeywords = {Software engineering} }