Home > Articles > Programming > C/C++

High-Performance Applications with C++: Video Podcast Transcript

In this transcription of an OnSoftware session, Bjarne Stroustrup and Herb Sutter talk with Ted Neward about the measure of a quality programming language, the importance of planning for interactions, and how to create something when you can't even imagine it.
Like this article? We recommend

Welcome to OnSoftware—conversations with thought leaders in software development. In this session, Bjarne Stroustrup (the creator of C++) and author Herb Sutter discuss C++ and other important applications.

Ted Neward: [Bjarne, you mentioned in a previous session that] your original work was in the space of concurrency. I know you've said that when you first sat down to create C with Classes, which was the original name for this thing we now call C++, a lot of it was based off of work you'd seen in Simula and so forth.

Bjarne Stroustrup: Oh, yes.

Ted: When you look back across the—what is it now, 20 years?—since you started that work, I think you said, mid '80s?

Bjarne: Twenty-five, I think. It was late '79 when I started. It's scary. It's scary.

Herb Sutter: Coming up on 30.

Ted: When you look back, it would seem to me to be somewhat surreal to think that you've created this thing that people have been using now for a quarter of a century—I mean, as you look across it, what's your first reaction?

Bjarne: It is surreal. It's somewhat scary, and also gratifying. I've been writing a paper for the ACM History of Programming Languages conference, where I have to look back over the last 15 years. Scary bit is I also wrote the previous one that looked back to the previous 15 years. But of course, then the question comes in, how do you measure success of a language? What is it you consider successful? Most people [think], "Oh, look at this beautiful language feature," or something like that. I think that's fundamentally wrong. You measure the quality of a programming language in the applications developed in it. I look back and say, "What has been done with this?" The basic code for the Human Genome Project was C++. The scene analysis in the autonomous driving system in the Mars Rover is C++. The search engines of Google and Amazon.com. So, my work has indirectly (most often indirectly) affected the world, in mostly positive ways—and that I'm proud of. It's not so scary in retrospect as it was when I knew some of these things were being attempted, and people were scaling my work several orders of magnitude bigger than any individual could handle in his or her own mind. So, yeah. A lot of good stuff was done with it, a lot of good stuff is being done with it. For all I know, the camera that takes the pictures throughout [this] program is C++. It's a very good chance that's true.

Herb: C++ is fairly viral, it's everywhere. Now, I have a question for you, though [pointing to Stroustrup], taking over the interview [looking at Neward].

Ted: By all means, please!

Herb: I once heard a good friend, a programming language designer, say that he never wanted to design a programming language that could only do the things that he could imagine. I think he was you?

Bjarne: Yes, that was me, and it's pretty fundamental. If I build a tool, I want something that's not just good for me now. It's good for me next year and the year after. And it should be good for my friends also and for lots of people. So you can't just build things that close and can do just what you can imagine. You have to have it much more general and much more open. So I've always concentrated on allowing it to express more things, and more general things, rather than trying to pinpoint exactly what's good for people—that kind of paternalistic thinking is outside—

Ted: I remember in The Design and Evolution of C++ you talked about—I forget which feature it was, or which discussion, but it was something to do with type aliases or whatnot—you said that during one of the standards meetings somebody said, "Oh, we can do that with the language facility today and walked up to the whiteboard and demonstrated how you could use a typedef to do exactly what the request was for. I remember specifically you said something to the effect of, "I had never even thought that this was possible, and here somebody was teaching me how to use my own language," which has always just sort of resonated with me—that same sense of, wow! Other people are using this in ways I had never really contemplated before.

Bjarne: It happens regularly, and it's really nice.

Herb: There's a potential pitfall in how to understand what that means, however. On the one hand, you could say that means, well, Bjarne may be a nice guy and fairly smart, but he didn't understand his own language. And so the design had accidental things that you could do that were unintended—that would be completely the wrong takeaway from that. Rather, the key to the approach that Bjarne is taking is to design a programming language with features that are solid in themselves, that work well, but that mesh together well. Anybody can design a programming language with n features. But do they deal with the n2 interactions between those features well? Or do they punt by saying, "Well, you just can't use feature x and y together at all"? Once you design the features so that they work in isolation, they mesh well, then you come up with new meshings and new combinations of those features in threes and in fours, and use them for new tools that nobody could imagine, because that n2, n4 is just too big a number to contemplate of all the interactions that could be. And that's how you generate lots of territory for people to discover and settle and build new cities.

Ted: Right.

Bjarne: So you build things aimed at combination; that is, I try not to design a particular solution to a particular problem. I try to solve and provide a set of general facilities to solve large classes of problems. And then I work on the affordability; that is, if what you are really going to do is use a combination of things, use a library or something like that, the combination has to be efficient enough that you couldn't hand-code or hack it in some lower-level style and lose generality again. So you need not just composability, but you need affordable composability. So, for instance, I'm often asked, "Did you imagine the STL? Or did you imagine the template metaprogramming?" And my answer is of course not, but I worked very, very hard on having a set of facilities that were general, efficient, and composable. And that had a lot of attention to where the type information was flowing around, so that it could be used later, so that optimizers could get their hands on it. And the net effect is that libraries, embedded systems programming, and high-performance numerics that I couldn't have written (because I don't know the application domains) had been written, and had become the backbone of high-performance applications in those areas. Did I imagine it? Well, I imagined people would do something like that, but I don't have sufficient knowledge to imagine the details.

Ted: One other thing, since obviously both of you are very much involved with the C++ standards effort: I think, Herb, you're the "convener"? Is that the right terminology?

Herb: Uh huh, we're both lifers, yeah.

Bjarne: "Convener" means he's the guy in charge of all the paperwork and rules and regulations and interactions with other groups.

Ted: And so, if we don't like the language, it's his fault?

[Stroustrup and Sutter point to each other. All laugh.]

For more information, visit onpodcastweekly.com and subscribe to all our podcasts. Brought to you by the publishing imprints and information portal of Pearson Education.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020