Home > Articles > Programming > C/C++

Bjarne Stroustrup and Herb Sutter on the Future of C++: Part 1: Video Podcast Transcript

In this transcription of an OnSoftware podcast, Bjarne Stroustrup and Herb Sutter talk with Ted Neward about some of the much-anticipated improvements in C++0x, why these changes were implemented, and the plan for release of a final draft.
Like this article? We recommend

Bjarne Stroustrup and Herb Sutter on the Future of C++: Part 1 (video transcription)

Welcome to OnSoftware—conversations with thought leaders in software development. In this session, Ted Neward, Bjarne Stroustrup, and Herb Sutter discuss the forthcoming features in C++0x. Learn about Bjarne and Herb's favorite new features.

Ted Neward: So, gentleman, a year [after our first set of conversations], we're doing this again.

Bjarne Stroustrup: Yeah, hello.

Herb Sutter: Here we are.

Ted: For those who are tuning in fresh, why don't you give us a little bit of background—who you are and what you do?

Bjarne: Well, I guess I'll do myself, as opposed to Herb. Bjarne Stroustrup, I'm here because I designed and implemented C++.

Ted: Wrote a book with that same title, too, as I recall.

Bjarne: Wrote a book or three with the same title, yes. I'm now a professor in Texas, and still work with C++—uses of it, teaching of it, programming it. Looking into a lot of industrial applications, things like that, just having a lot of interesting stuff going on.

Ted: You're still a part of the C++ committee, right?

Bjarne: Oh, yes. I mean, we're here together [gestures at Sutter and himself], I think, because we came from the standards committee meeting last week. And, well, standards work is not exactly fun—

[All laugh.]

Bjarne: But it's important, and this is one of the ways you can get useful things out to people numbering millions and lasting for decades. So it's important work, and it reflects interesting work.

Ted: We'll get to that, I'm sure.

Bjarne: Yes.

Ted: Herb.

Herb: Who am I? And what am I doing here?

Ted: Yeah.

Herb: I run that standards committee, somehow they managed to let me do that, which mostly means saying when we're going to meet. We were just there [gestures at Stroustrup] and had a nice meeting in Washington State. And voted in Lambda functions (well, that's one of the things we did) into the C++0x working draft. We'll talk more about those things later.

Ted: We'll get to that later, too, yeah.

Herb: Yeah, so that's kind of nice, we're making progress. So here at SD, we're talking about C++. I've been doing lot of concurrency work lately with multicore and everything happening, "free lunch" being over—well, yes, except we just need to line up at a new free lunch, but where is that trough and how do we find it? That's where most of my work is these days, both at Microsoft and also at my independent work, as my professional life is sort of in both of those areas.

Ted: Okay, alright. So, since you guys talked about the standards that you're working on—C++ working draft, V.next, do we have an estimate on when it's going to be not a working draft, but a public final or final draft?

Bjarne: Current schedule is, I think, October this year. And we have one more meeting; we're all going to sunny France, have a wonderful time in a windowless room, for a week on the Riviera.

Ted: You know, that sounded good until you said "windowless room."

Bjarne: Yes.

Herb: It's always a windowless room.

Bjarne: We had a whole week, 12-hour days, Hawaii, on the beach—in a windowless room. I mean, some people are just gluttons for punishment.

Ted: Wow. Well, how many of the members brought their wives with them, just to try to, like, earn some marriage points? Because I could see that.

Bjarne: Hawaii? Only a handful, because they knew it was—I mean, these are the late meetings, they're difficult. A couple of years ago, it was almost half, but now the work is harder and the free time is less free.

Ted: Okay, alright.

Herb: Especially since we want, at our next meeting in France, to vote the last major features into the working draft and then give it one meeting to sit. Then, in September, when we meet, hopefully (if we meet the schedule) vote out a complete draft for public review and then just do edits and minor fixes for the next year before we finally ship it. We'll see if we make it. It's looking good, we hope that we will, but we're getting close to knowing the good shape of C++0x and what exactly to expect.

Bjarne: So, feature complete, June; draft for public review, October; all kinds of official steps sometime next year. So, we hope in C++0x that "x" will still be decimal—

[All laugh.]

Bjarne: But we will get the work done by then. Whether the ISO process can grind its way with official nation votes and such....

Ted: But it'll be at a point where, presumably, compilers would be able to support C++0x by 2009?

Herb: Well, that depends. If you're talking about a complete implementation, that always takes a little longer, because some compilers implement some features, and others in the next release. But several compilers have already implemented parts of C++0x—even though the standard has not sailed yet. But those parts are considered fairly stable, so some vendors have done that already. So, there are several parts that you can get already in implementations.

Ted: So, since we're sort of dancing around the subject, C++0x contains—you mentioned Lambdas; what else is there? Because that, you said, just voted in. So what bits are in C++0x that have been there for a while now?

Bjarne: This is really new—that was Saturday, Lambdas.

Herb: And today is Tuesday.

[All laugh.]

Ted: This is hot news! We're gonna to have to rush to press with this one.

Bjarne: And we've done a lot of work on the foundations for concurrency: machine model, a little bit of language primitives necessary, atomics, and the thread—standard threads, on which you can build different higher-level concurrency models.

Ted: So we're getting a standard thread model in the language?

Herb: In the library.

Ted: In the library.

Herb: Memory-model–defining language semantics; but the rest, it turned out, could largely be built as libraries, using the other C++ power features.

Bjarne: If you have the right primitives, you can build just about anything as libraries. If you don't have the right primitives, it's well known to be impossible.

Herb: So the primitives here, I mentioned memory model, the other one is atomic operations. Java-style volatile—the same kind of thing, something you can use atomically for lock-free programming, or to implement locks and threads on top.

Ted: Since you brought up Java, how much—

Herb: You just clued in on the J-word!

Ted: Well, you know—you gotta jump on these! [Laughs.] You offer me these, you know, holes—ever so tiny.

Bjarne: Holes?

Ted: Well, obviously, there was a lot of work that went on in Java 5 with the java.util.concurrent package; Doug Lea was a part of that, and William Pugh, who originally pointed out the flaws in the Java memory model. So will we see library support in the same sense that we see java.util.concurrent? We have atomic Boolean and atomic long classes, we have reader-writer lock classes, we have executor thread pool service, and stuff like that? Or do we get atomic as a template? Give me an idea of how it looks.

Herb: There are great similarities with what Java did in 5 and 6, and of course Java 7 is working now and adding the fork/join and other models. This is an evolutionary process that all of us are evolving on. We'll get largely what Java has (think of it in terms of the facilities). Memory model is state-of-the-art memory model, on par with anything, and that all the hardware vendors are able to support—and operating system and compiler vendors.

Ted: I suppose that would be important, that the hardware vendors could actually support it.

[All laugh.]

Herb: Yes, I have more appreciation for Henry Kissinger of ages past, doing shuttle diplomacy among five major hardware vendors (that I won't name) for about six months, to make sure things worked.

Ted: We could probably figure out who two or three of them are. [Laughs.]

Bjarne: We need a sort of a contract between the hardware architects and the compiler writers, because C++ is still very close to the hardware. And it took them some time to figure out what that contract was going to be, and what could be delivered.

Ted: But that's all done now.

Bjarne: It's done.

Ted: Good. So I don't have to worry about it—even better. So, what else is there?

Herb: Threads, mutexes, same kinds of things. Now, some of the concurrency libraries are in C++0x, the next standard itself; and others will be coming shortly thereafter, as sort of an add-on pack, a second batch of standard library extensions. We already delivered one of those several years ago, which is now in the standard.

Ted: That was the TR1 [C++ Technical Report 1], right?

Herb: TR1, which is now largely in the standard. And now TR2 includes things like thread pools and reader-writer locks, probably, and that's the intent for what we have planned to add shortly after C++0x.

Ted: Okay. Any core language changes?

Bjarne: Yeah, most of them are focused on better support for generic programming because it's such a runaway success with C++ 98, but it's creaking in places. So we get concepts, which is a very flexible mechanism for type-checking of template documents, and things like that. We're going to get automatics, which is basically a way of declaring variables so that they get the type of their initializer, saving a lot of writing. We're going to get some aliasing mechanisms for types (would be template typedefs in the old term). Lambdas fit in there. We're going to get a new FOR loop that will allow easier traversal of containers. All loaded based on concepts. There's a whole package of features designed to work together to make it easier to write good generic code, have it perform as well as we're used to, get better error messages if you mess up, and overall write much less to get the results.

Ted: Hmm. Okay.

Herb: Have you ever compiled templates and seen template error messages?

Ted: [Groans.] Oh yes.

Bjarne: Spectacularly bad.

Herb: Templates work great, but the error messages are, shall we say, sometimes inscrutable.

Ted: I can remember, literally, watching, scrolling through it. [Gestures to indicate a long screen.] I can't remember if it was a Borland or Visual error window—it was really War and Peace.

Bjarne: It's horrible.

Herb: However, the most important thing to know about concepts is that you can say what you mean, so those template error messages should be a thing of the past.

Ted: I'll hold you to that! We'll check in next year and see.

Herb: We're showing live examples this week.

Bjarne: You can check it now. It works.

Ted: Check it now using...?

Herb: ConceptGCC is a prototype implementation that some of the standards committee people have done, that shows how it works—and you can Google for that.

Ted: Concept-dash-GCC?

Herb: ConceptGCC, all one word.

Ted: ConceptGCC, okay. I'll hold you to that.

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