Reading PAGE
Peer Evaluation activity
| Trusted by | 1 |
| Downloads | 1 |
| Views | 17 |
Total impact ?
Send a 
Andrew has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
This was brought to you by:
A Formalization of Concepts for Generic Programming
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Description
Title : A Formalization of Concepts for Generic Programming
Area : Computer Science
Language : English
Url : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.75.3151&rep=rep1&type=pdf
Doi : 10.1.1.75.3151
Abstract : Abstract. Generic programming is a paradigm for systematic design and classification of software components for optimal reuse. It has been the guiding methodology behind the design of the C++ Standard Template Library and numerous other C++ libraries. Generic programming starts with algorithms, seeking to identify the minimal requirements on types necessary for correct and efficient execution of an algorithm or family of algorithms, leading to generic algorithms that can be applied to arguments of many different types. The term concept is used in this context to mean a set of abstractions (such as types) whose membership is determined by a set of requirements. Despite their importance, concepts are not explicitly represented in traditional programming languages. C++, in particular, lacks any means to express concepts, which has forced all concept development to be done outside the language and thus be unavailable to C++ compilers for static checking or optimization. Several other languages do have features than can approximate certain aspects of concepts, but what is missing is a uniform, language-independent definition of concepts. The definition of concepts in this paper provides a unified framework for realizing concept approximations in existing languages, and we present such descriptions for several popular languages used for generic programming. 1
Subject : unspecifiedArea : Computer Science
Language : English
| Affiliations : |
Doi : 10.1.1.75.3151
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Andrew's Peer Evaluation activity
| Trusted by | 1 |
- FPeer Evaluation, Publisher, Peer Evaluation.
| Downloads | 1 |
| Views | 17 |
- 3A checkpoint and restart service specification for open mpi
- 3A cluster-based parallel image processing toolkit
- 3A Component Architecture for LAM/MPI
- 3A Language for Generic Programming
- 22.1 Fault Detection......................................... 5
- 1 Optimizing a Conjugate Gradient Solver with Non-Blocking Collective Operations
- 1A Case for Standard Non-Blocking Collective Operations
- 1A Formalization of Concepts for Generic Programming
Andrew has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available
Your email