Difference between revisions of "Publications/duret.01.coots"
From LRDE
Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
+ | | published = true |
||
| date = 2001-01-01 |
| date = 2001-01-01 |
||
| authors = Alexandre Duret-Lutz, Thierry Géraud, Akim Demaille |
| authors = Alexandre Duret-Lutz, Thierry Géraud, Akim Demaille |
Revision as of 15:51, 14 November 2013
- Authors
- Alexandre Duret-Lutz, Thierry Géraud, Akim Demaille
- Where
- Proceedings of the 6th USENIX Conference on Object-Oriented Technologies and Systems (COOTS)
- Place
- San Antonio, TX, USA
- Type
- inproceedings
- Publisher
- USENIX Association
- Keywords
- Software engineering
- Date
- 2001-01-01
Abstract
Generic programming is a paradigm whose wide adoption by the C++ community is quite recent. In this approach most classes and procedures are parameterized, leading to the construction of general and efficient software components. In this paper, we show how some design patterns from Gamma et al. can be adapted to this paradigm. Although these patterns rely highly on dynamic binding. We show that, by making intensive use of parametric polymorphism in the context of generic programming, the method calls in these patterns can be resolved at compile-time. The speed-up achieved using these patterns is significant.
Bibtex (lrde.bib)
@InProceedings{ duret.01.coots, author = {Alexandre Duret-Lutz and Thierry G\'eraud and Akim Demaille}, title = {Generic design patterns in {C++}}, booktitle = {Proceedings of the 6th USENIX Conference on Object-Oriented Technologies and Systems (COOTS)}, year = 2001, address = {San Antonio, TX, USA}, pages = {189--202}, month = {January-February}, publisher = {USENIX Association}, project = {Software}, abstract = {Generic programming is a paradigm whose wide adoption by the C++ community is quite recent. In this approach most classes and procedures are parameterized, leading to the construction of general and efficient software components. In this paper, we show how some design patterns from Gamma et al. can be adapted to this paradigm. Although these patterns rely highly on dynamic binding. We show that, by making intensive use of parametric polymorphism in the context of generic programming, the method calls in these patterns can be resolved at compile-time. The speed-up achieved using these patterns is significant.} }