| 1. |
- Bernardy, Jean-Philippe, 1978, et al.
(author)
-
A comparison of C++ concepts and Haskell type classes
- 2008
-
In: ACM SIGPLAN Workshop on Generic Programming 2008. Victoria, Canada, 20th September 2008. - 9781605580609 ; , s. 37-48
-
Conference paper (peer-reviewed)abstract
- Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Since each language that meets all criteria is considered generic, those criteria are not fine-grained enough to differentiate between two languages for generic programming.We refine these criteria into a taxonomy that capturesdifferences between type classes in Haskell and concepts inC++, and discuss which differences are incidental and whichones are due to other language features. The taxonomy allows for an improved understanding of language support for generic programming, and the comparison is useful for the ongoing discussions among language designers and users of both languages.
|
|
| 2. |
- Bernardy, Jean-Philippe, 1978, et al.
(author)
-
Generic programming with C++ concepts and Haskell type classes—a comparison
- 2010
-
In: Journal of Functional Programming. - 1469-7653 .- 0956-7968. ; 20:3-4, s. 271-302
-
Journal article (peer-reviewed)abstract
- Earlier studies have introduced a list of high-level evaluation criteria to assess how well a language supports generic programming. Languages that meet all criteria include Haskell, because of its type classes, and C++ with the concept feature. We refine these criteria into a taxonomy that captures commonalities and differences between type classes in Haskell and concepts in C++, and discuss which differences are incidental and which ones are due to other language features. The taxonomy allows for an improved understanding of language support for generic programming, and the comparison is useful for the ongoing discussions among language designers and users of both languages.
|
|
| 3. |
- Lincke, Daniel, et al.
(author)
-
Generic libraries in C++ with concepts from high-level domain descriptions in Haskell: A domain-specific library for computational vulnerability assessment
- 2009
-
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783642030338 ; 5658/2009, s. 236-261
-
Conference paper (peer-reviewed)abstract
- A class of closely related problems, a problem domain, can often be described by a domain-specific language, which consists of algorithms and combinators useful for solving that particular class of problems. Such a language can be of two kinds: it can form a new language or it can be embedded as a sublanguage in an existing one. We describe an embedded DSL in the form of a library which extends a general purpose language. Our domain is that of vulnerability assessment in the context of climate change, formally described at the Potsdam Institute for Climate Impact Research. The domain is described using Haskell, yielding a domain specific sublanguage of Haskell that can be used for prototyping of implementations.In this paper we present a generic C++ library that implements a domain-specific language for vulnerability assessment, based on the formal Haskell description. The library rests upon and implements only a few notions, most importantly, that of a monadic system, a crucial part in the vulnerability assessment formalisation. We describe the Haskell description of monadic systems and we show our mapping of the description to generic C++ components. Our library heavily relies on concepts, a C++ feature supporting generic programming: a conceptual framework forms the domain-specific type system of our library and parametrised types and functions, ``typed'' by the concepts in our conceptual framework, represent the combinators and algorithms of the domain. Furthermore, we discuss what makes our library a domain specific language and how our domain-specific library scheme can be used for other domains (concerning language design, software design, and implementation techniques).
|
|
| 4. |
- Munkby, Gustav, 1981, et al.
(author)
-
Scrap++: Scrap Your Boilerplate in C+
- 2006
-
In: Workshop on Generic Programming.
-
Conference paper (peer-reviewed)abstract
- "Scrap Your Boilerplate" (SYB) is a well studied and widely used design pattern for generic traversal in the Haskell language, but almost unknown to generic programmers in C++. This paper shows that SYB can be implemented in C++. It identifies the features and idioms of C++ that correspond to the Haskell constructs that implement SYB, or can be used to emulate them, and provides a prototype C++ implementation.
|
|
| 5. |
- Schupp, Sibylle, 1964, et al.
(author)
-
Rapid performance prediction for library components
- 2004
-
In: Proceedings of the Fourth International Workshop on Software and Performance, WOSP'04; Redwood Shores, CA; United States; 14 January 2004 through 16 January 2004. - : Association for Computing Machinery (ACM). - 9781581136739 ; , s. 69-73
-
Conference paper (peer-reviewed)abstract
- Component-based programming is a methodology for designing software systems as assemblages of components with a low degree of coherence and a high degree of orthogonality. Decoupling and orthogonality, however, require coupling and assembling on the side of the component's client. This paper addresses performance problems that occur in the composition specifically of library components. We discuss the design and implementation of a composer, which assembles library components based on a classification of their declarative performance descriptions. Employing an off-the-shelf decision-tree procedure for selecting, and the C++ technique of traits for propagating the desired behavior throughout the whole library, our system allows for rapid performance predictions. It is applied to FFTL, an "STL-like" C++ library for the Fast Fourier Transform.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Zalewski, Marcin, 1978, et al.
(author)
-
C++ concepts as institutions: A specification view on concepts
- 2007
-
In: ACM SIGPLAN Symposium on Library-Centric Software Design LCSD'07, co-located with the Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'07). - New York, New York, USA : ACM Press. - 9781605580869 ; , s. 76-87
-
Conference paper (peer-reviewed)abstract
- With the recent developments in the C++ language, concepts are mostly discussed as a form of constrained polymorphism. Yet, concepts also allow for an alternative, implementation-independent view that comes from their origin in (algebraic) specification languages. In this paper, we return to this specification view on concepts and formalize C++ concepts as institutions, a well-established notion for precise specifications of software components. We argue that institutions form a suitable theoretical framework for software systems like libraries where the different parts establish relations that are captured by different logics, or no formal logic at all. Assuming the C++ concept descriptions, concept maps, and axioms as in the draft currently accepted by the C++ standardization committee, we show that concept descriptions and axioms form an institution (with equational logic) but also, and perhaps surprisingly, that concept descriptions and concept maps form an institution (with no formal logic).
|
|
| 9. |
- Zalewski, Marcin, 1978, et al.
(author)
-
Change Impact Analysis for Generic Libraries
- 2006
-
In: ICSM 2006: 22nd IEEE International Conference on Software Maintenance; Philadelphia, PA; United States; 24 September 2006 through 27 September 2006. - 9780769523545 ; , s. 35-44
-
Conference paper (peer-reviewed)abstract
- Since the Standard Template Library (STL), generic libraries in C++ rely on concepts to precisely specify the requirements of generic algorithms (function templates) on their parameters (template arguments). Modifying the definition of a concept even slightly, can have a potentially large impact on the (interfaces of the) entire library. In particular the non-local effects of a change, however, make its impact difficult to determine by hand. In this paper we propose a \conceptual change impact analysis (CCIA), which determines the impact of changes of the conceptual specification of a generic library. The analysis is organized in a pipe-and-filter manner, where the first stage finds any kind of impact, the second stage various specific kinds of impact. Both stages describe reachability algorithms, which operate on a conceptual dependence graph. In a case study, we apply CCIA to a new proposal for STL iterator concepts, which is under review by the C++ standardization committee. The analysis shows a number of unexpected incompatibilities and, for certain STL algorithms, a loss of genericity.
|
|
| 10. |
- Zalewski, Marcin, 1978, et al.
(author)
-
Changing Iterators with Confidence. A Case Study of Change Impact Analysis Applied to Conceptual Specifications.
- 2005
-
In: Library-Centric Software Design, an OOPSLA workshop.
-
Conference paper (peer-reviewed)abstract
- Design and implementation of generic libraries in C++ are based on conceptual specifications---what if such specifications have to change? In a quite practical sense, this question arises because of a new proposal for iterator concepts that is under discussion among C++ library developers. Given the fundamental role of iterator concepts, it is important to anticipate which impact the proposed changes have on legacy code. Yet, no tool has been available to safely check for unwanted effects. We introduce a conceptual change impact analysis and apply it to the proposed iterator specification. Surprisingly, the analysis yields that the proposed iterator concepts are neither (fully) backward- nor forward-compatible with the current, standardized concepts. Since the analysis also lists the sources of incompatibility, it can help library designers to avoid unintended effects of their suggested changes and, in general, provides a base for assessing the impact of a conceptual change.
|
|
