General Constant Expressions for System Programming Languages

Total Page:16

File Type:pdf, Size:1020Kb

General Constant Expressions for System Programming Languages General Constant Expressions for System Programming Languages Gabriel Dos Reis Bjarne Stroustrup Texas A&M University Texas A&M University [email protected] [email protected] Abstract time to minimize startup costs and memory consumption. Main- Most mainstream system programming languages provide sup- stream system programming languages, such as C and C++ do not port for builtin types, and extension mechanisms through user- have standard, reliable, and systematic language features for ex- defined types. They also come with a notion of constant expressions pressing that. At best, values that must be known before run time whereby some expressions (such as array bounds) can be evaluated can only be expressed in an impoverished subset of a language and at compile time. However, they require constant expressions to be must rely on non-standard conventions selectively implemented by written in an impoverished language with minimal support from the compilers. type system; this is tedious and error-prone. This paper presents a We developed a general and formal model for compile time framework for generalizing the notion of constant expressions in evaluation that can be applied to provide compile-time evalua- modern system programming languages. It extends compile time tion for a wide variety of programming languages. For space con- evaluation to functions and variables of user-defined types, thereby straints, we will limit this paper to an informal presentation of that including formerly ad hoc notions of Read Only Memory (ROM) framework. Our examples will be in C++ and some of our specific objects into a general and type safe framework. It allows a program- language-technical design decisions reflect our experience with the mer to specify that an operation must be evaluated at compile time. C++ language, implementation, use, and the C++ standards pro- Furthermore, it provides more direct support for key meta program- cess. ming and generative programming techniques. The framework is Consider a simple a jump table: formalized as an extension of underlying type system with a bind- typedef void (*handler_t)(); ing time analysis. It was designed to meet real-world requirements. extern void handler1(); In particular, key design decisions relate to balancing experssive extern void handler2(); power to implementability in industrial compilers and teachability. const handler_t jumpTable[] = { It has been implemented for C++ in the GNU Compiler Collection, &handler1, &hanlder2 and is part of the next ISO C++ standard. }; Categories and Subject Descriptors D.3 [Programming Lan- Obviously we could place jumpTable in ROM — all the infor- guages]: Language Constructs and Features mation to do so is available. Indeed, some (but not all) production compilers recognize such constructs and generate appropriate static General Terms Languages, Standardization initialization. However, relying on conventions leads to brittle and non-portable code, pushing programmers towards proprietary lan- 1. Introduction guages and language extensions. Modern high level programming languages typically feature a va- The usual meaning of const object is an unchanging datum, a riety of abstraction mechanisms to support popular programming value. However, that interpretation is insufficient to ensure that the methodologies: object-based programming, object-oriented pro- object is initialized in such a way it is placed in ROM. Consider: gramming, functional programming, generic programming, etc. double mileToKm(double x) { return 1.609344 * x; } For system programming, however, the abstraction support is in- complete. A distinctive trait of system programming is the ability to const double marks[] = { describe data known at program translation time. Such data are usu- mileToKm(2.3), mileToKm(0.76) ally denoted by so called constant expressions (C, C++, Java, etc.) }; or static expressions (e.g. Ada). Furthermore, for embedded sys- tems we typically need to describe data that should reside in Read This defines the array object marks as unchanging, but there is no Only Memory (ROM). It is also common to need tables with non- guarantee that the values are computed at compile time. Indeed trivial structure that ideally are computed at compile time or link since mileToKm() is a function, this will generate (redundant) dynamic (run-time) initialization, that unfortunately ensures that marks never ends up in ROM. ISO C++ [1] does not provide a systematic and reliable way for the programmer to require that a particular object must be evaluated at compile time or link time. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed A workaround for this “permissive” const semantics is for pro- for profit or commercial advantage and that copies bear this notice and the full citation grammers to use preprocessor macros, designed for token substitu- on the first page. To copy otherwise, to republish, to post on servers or to redistribute tions, rather than general and type safe language mechanisms. For to lists, requires prior specific permission and/or a fee. example the function mileToKm may be replaced with the macro SAC ’10 March 22–26, 2010, Sierre, Switzerland Copyright c 2010 ACM 978-1-60558-638-0/10/03. $5.00 #define MILE_TO_KM(M) ((M) * 1.609344) However, preprocessor macros are brittle abstraction tools, fraught Given those two types our example shrinks to: with type, namespace, and scope problems. For example, assume constexpr LengthInKM marks[] = { that two collaborating teams want to make sure that units of mea- LengthInMile(2.3), LengthInMile(0.76) surement are not confused (potentially leading to catastrophic }; crashes). An obvious solution would be to adopt a “typeful pro- gramming” discipline using distinct classes/types to represent val- Obviously the representations of both classes LengthInKM and ues of differing units. For instance, they may provide LengthInKM LengthInMile are “sufficiently simple” for the compiler to “un- and LengthInMile types so that the marks initialization could be derstand” — each is represented by a single value of the built-in written: type double. All member functions are defined with the keyword constexpr to ensure that the compiler checks that it can evaluate const LengthInKM marks[ ] = { their bodies at compile time. Obviously, these functions are “suffi- LengthInKM(MILE_TO_KM(2.3)), ciently simple” for compile time evaluation. LengthInKM(MILE_TO_KM(0.76)) We use two objects of type LengthInMile to initialize an array }; marks of objects of type LengthInKM. Because marks is defined That looks good, but the use of the class LengthInKM with a with the keyword constexpr the construction and conversions are constructor brings back the problem with ROMability avoided all performed at compile time. The compiler will issue an error if through the use of the macro MILE_TO_KM instead of the func- the initialization of a constexpr object is dynamic. The notion of tion mileToKm. Again, this may go unnoticed since the resulting constant expression is no longer limited to a handful builtin types (dynamic initialization) code is correct from the C++ language and operations, but also applies to user-defined types and functions. point of view. What we see here is a failure to support user-defined Critically, the rules for compilation and evaluation are simple for type abstractions at the same level as builtin types. In reality, the both compilers and users. problem is worse because it forces programmers to avoid key facil- The rest of this paper is structured as follows. Section 2 introduces ities of the C++ standard library and of embedded systems support the notion of literal types, constexpr functions, and discusses some libraries. of the pitfalls that need to be avoided. Then x3 considers recur- The problems illustrated above are not specific to C or C++. They sive constexpr function. Section 4 consider extensions to functions are shared by all mainstream languages used for system program- taking parameters by reference; then x5 considers interaction with ming. Almost invariably, they define the notion of constant expres- object-oriented facilities (e.g. inheritance, virtual functions). Fi- sion or static expression as an expression of builtin types (e.g. in- nally we highlight related works in x6 and conclude in x8. Fine tegers only) using only a restricted list of builtin operators (i.e. no points and technical aspects of the design are made precise in a de- functions) and builtin constants. This paper proposes a methodol- tailed static semantics following a natural semantics style [3] pre- ogy to develop the notion of general constant expression applicable sentation contained in a much longer technical report. to most modern system programming languages. The methodol- ogy has been instantiated for C++, implemented in a version of the 2. Constant Expressions GNU Compiler Collection, and has been accepted for the C++0x We start with the notion of a constant expression as it has appeared draft standard. It introduces two notions: in C++ from its inception. From that, we proceed through a se- • literal types: A literal type is one which is “sufficiently simple” quence of generalizations. so that the compiler knows its layout at compile time (see x2.2). In some contexts — such as array bounds — an expression is re- • constexpr functions: A constexpr function is one which is “suf- quired to evaluate to a constant. A constant expression is either ficiently simple” so that it delivers a constant expression when a literal, a relational expression the sub-expressions of which are int called with arguments that are constant values (see x2.1). constant expressions, an arithmetic expression of type whose sub-expressions are constant expressions, or a conditional expres- The “length example” can be written more clearly, type safe, and sion whose sub-expressions are all constant expressions. The name without added run-time or space overheads in C++0x. We start by of global variables defined with the const keyword and initialized defining a type LenghtInKM: with constant expressions also evaluates to a constant expression.
Recommended publications
  • Thriving in a Crowded and Changing World: C++ 2006–2020
    Thriving in a Crowded and Changing World: C++ 2006–2020 BJARNE STROUSTRUP, Morgan Stanley and Columbia University, USA Shepherd: Yannis Smaragdakis, University of Athens, Greece By 2006, C++ had been in widespread industrial use for 20 years. It contained parts that had survived unchanged since introduced into C in the early 1970s as well as features that were novel in the early 2000s. From 2006 to 2020, the C++ developer community grew from about 3 million to about 4.5 million. It was a period where new programming models emerged, hardware architectures evolved, new application domains gained massive importance, and quite a few well-financed and professionally marketed languages fought for dominance. How did C++ ś an older language without serious commercial backing ś manage to thrive in the face of all that? This paper focuses on the major changes to the ISO C++ standard for the 2011, 2014, 2017, and 2020 revisions. The standard library is about 3/4 of the C++20 standard, but this paper’s primary focus is on language features and the programming techniques they support. The paper contains long lists of features documenting the growth of C++. Significant technical points are discussed and illustrated with short code fragments. In addition, it presents some failed proposals and the discussions that led to their failure. It offers a perspective on the bewildering flow of facts and features across the years. The emphasis is on the ideas, people, and processes that shaped the language. Themes include efforts to preserve the essence of C++ through evolutionary changes, to simplify itsuse,to improve support for generic programming, to better support compile-time programming, to extend support for concurrency and parallel programming, and to maintain stable support for decades’ old code.
    [Show full text]
  • Ali Aydar Anita Borg Alfred Aho Bjarne Stroustrup Bill Gates
    Ali Aydar Ali Aydar is a computer scientist and Internet entrepreneur. He is the chief executive officer at Sporcle. He is best known as an early employee and key technical contributor at the original Napster. Aydar bought Fanning his first book on programming in C++, the language he would use two years later to build the Napster file-sharing software. Anita Borg Anita Borg (January 17, 1949 – April 6, 2003) was an American computer scientist. She founded the Institute for Women and Technology (now the Anita Borg Institute for Women and Technology). While at Digital Equipment, she developed and patented a method for generating complete address traces for analyzing and designing high-speed memory systems. Alfred Aho Alfred Aho (born August 9, 1941) is a Canadian computer scientist best known for his work on programming languages, compilers, and related algorithms, and his textbooks on the art and science of computer programming. Aho received a B.A.Sc. in Engineering Physics from the University of Toronto. Bjarne Stroustrup Bjarne Stroustrup (born 30 December 1950) is a Danish computer scientist, most notable for the creation and development of the widely used C++ programming language. He is a Distinguished Research Professor and holds the College of Engineering Chair in Computer Science. Bill Gates 2 of 10 Bill Gates (born October 28, 1955) is an American business magnate, philanthropist, investor, computer programmer, and inventor. Gates is the former chief executive and chairman of Microsoft, the world’s largest personal-computer software company, which he co-founded with Paul Allen. Bruce Arden Bruce Arden (born in 1927 in Minneapolis, Minnesota) is an American computer scientist.
    [Show full text]
  • Bjarne Stroustrup
    Bjarne Stroustrup 52 Riverside Dr. #6A +1 979 219 5004 NY, NY 10024 [email protected] USA www.stroustrup.com Education Ph.D. in Computer Science, University of Cambridge, England, 1979 Ph.D. Thesis: Communication and Control in Distributed Computer Systems Thesis advisor: David Wheeler Cand.Scient. in Mathematics with Computer Science, Aarhus University, Denmark, 1975 Thesis advisor: Brian H. Mayoh Research Interests Distributed Systems, Design, Programming techniques, Software development tools, and Programming Languages Professional Experience Technical Fellow, Morgan Stanley, New York, January 2019 – present Managing Director, Division of Technology and Data, Morgan Stanley, New York, January 2014 – present Visiting Professor, Columbia University, New York, January 2014 – present Visiting Professor in the Computer Lab and Fellow of Churchill College, Cambridge University, Spring 2012 Visiting Professor in the Computer Science Department, Princeton University, Fall 2011 The College of Engineering Chair Professor in Computer Science, Department of Computer Science, Texas A&M University, October 2002 – January 2014 Department Head, AT&T Laboratories – Research, Florham Park, New Jersey, July 1995 – October 2002 Distinguished Member of Technical Staff, AT&T Bell Laboratories, Murray Hill, NJ, June 1987 – July 1995 Member of Technical Staff, AT&T Bell Laboratories, Murray Hill, NJ, March 1979 – June 1987 Honors & Awards 2019: Honorary doctor of University Carlos III in Madrid, Spain. 1 2018: The John Scott Legacy Medal and Premium from The Franklin Institute and the City Council of Philadelphia to men and women whose inventions improved the comfort, welfare, and happiness of human kind in a significant way. 2018: The Computer Pioneer Award from The IEEE Computer Society For bringing object- oriented programming and generic programming to the mainstream with his design and implementation of the C++ programming language.
    [Show full text]
  • Academic Program Review
    Academic Program Review April 16-18, 2012 Department of Computer Science and Engineering Room 301 Harvey R. Bright Building Texas A&M University College Station, Texas 1 Contents I Introduction ............................................................................................................................... 4 I.1 Charge to Review Committee ............................................................................................. 4 I.2 Schedule of Review/Itinerary ............................................................................................. 5 I.3 Administrative Structure .................................................................................................... 6 II Brief History ............................................................................................................................... 7 II.1 Founding of Department .................................................................................................... 7 II.2 Founding and Development of Related Centers ................................................................ 7 II.3 Review and Changes in Past Seven Years ........................................................................ 15 II.4 Date of Last Program Review ........................................................................................... 16 III Vision and Goals ................................................................................................................... 16 III.1 Strategic Plan ...................................................................................................................
    [Show full text]
  • A History of C++: 1979− 1991
    A History of C++: 1979−1991 Bjarne Stroustrup AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This paper outlines the history of the C++ programming language. The emphasis is on the ideas, constraints, and people that shaped the language, rather than the minutiae of language features. Key design decisions relating to language features are discussed, but the focus is on the overall design goals and practical constraints. The evolution of C++ is traced from C with Classes to the current ANSI and ISO standards work and the explosion of use, interest, commercial activity, compilers, tools, environments, and libraries. 1 Introduction C++ was designed to provide Simula’s facilities for program organization together with C’s effi- ciency and flexibility for systems programming. It was intended to deliver that to real projects within half a year of the idea. It succeeded. At the time, I realized neither the modesty nor the preposterousness of that goal. The goal was modest in that it did not involve innovation, and preposterous in both its time scale and its Draco- nian demands on efficiency and flexibility. While a modest amount of innovation did emerge over the years, efficiency and flexibility have been maintained without compromise. While the goals for C++ have been refined, elaborated, and made more explicit over the years, C++ as used today directly reflects its original aims. This paper is organized in roughly chronological order: §2 C with Classes: 1979– 1983. This section describes the fundamental design decisions for C++ as they were made for C++’s immediate predecessor. §3 From C with Classes to C++: 1982– 1985.
    [Show full text]
  • Introduc)On to C++
    Introduc)on to C++ CS 16: Solving Problems with Computers I Lecture #2 Ziad Matni Dept. of Computer Science, UCSB Announcements • Homework #1 due today – Please take out any staples or paper clips • No more switching lab )mes – Labs at 9am, 10am, 11am are FULL – Other labs have some space leF 9/27/16 Matni, CS16, Fa16 2 Lecture Outline • Computer Systems -­‐-­‐-­‐ A review from last week • Programming and Problem Solving • IntroducPon to C++ 9/27/16 Matni, CS16, Fa16 3 Defining Computer A device that can be instructed to carry out an arbitrary set of arithme)c or logical opera)ons automaPcally 9/27/16 Matni, CS16, Fa16 4 Computer SoFware • The collecPon of programs used by a computer, and includes: – ApplicaPons – Translators (compilers) – System Managers (drivers, other OS components) 9/27/16 Matni, CS16, Fa16 5 5 Main Components to Computers • Inputs • Outputs • Processor • Main memory – Usually inside the computer, volaPle • Secondary memory – More permanent memory for mass storage of data 9/27/16 Matni, CS16, Fa16 6 Computer Memory • Usually organized in two parts: – Address • Where can I find my data? – Data (payload) • What is my data? • The smallest representaPon of the data – A binary bit (“0”s and “1”s) – A common collecPon of bits is a byte (8 bits = 1 byte) 9/27/16 Matni, CS16, Fa16 7 What is the Most Basic Form of Computer Language? • Binary a.k.a Base-­‐2 • Expressing data AND instrucPons in either “1” or “0” – So, “01010101 01000011 01010011 01000010 00100001 00100001” could mean an instruc-on to “calculate 2 + 3” Or it could
    [Show full text]
  • 2004 Annual Report
    2004 Annual Report NATIONAL ACADEMY OF ENGINEERING ENGINEERING THE FUTURE NATIONAL ACADEMY OF ENGINEERING 2101 Constitution Avenue, NW Washington, DC 20418 www.nae.edu 1 Letter from the President 3 In Service to the Nation 3 Mission Statement 4 Program Reports The National Academy of Sciences is a private, non- 4 Engineering Education profit, self-perpetuating society of distinguished schol- 4 ars engaged in scientific and engineering research, Center for the Advancement of Scholarship on dedicated to the furtherance of science and technolo- Engineering Education gy and to their use for the general welfare. Upon the 5 authority of the charter granted to it by the Congress in Technological Literacy 1863, the Academy has a mandate that requires it to 6 Public Understanding of Engineering advise the federal government on scientific and techni- cal matters. Dr. Ralph J. Cicerone is president of the Media Relations National Academy of Sciences. Public Relations The National Academy of Engineering was established Developing Effective Messages Project in 1964, under the charter of the National Academy of Great Achievements Website Sciences, as a parallel organization of outstanding 8 engineers. It is autonomous in its administration and in Engineering Ethics the selection of its members, sharing with the National 8 Diversity in the Engineering Workforce Academy of Sciences the responsibility for advising the 11 federal government. The National Academy of Engi- Frontiers of Engineering neering also sponsors engineering programs aimed at Lillian M. Gilbreth Lectureships for Young Engineers meeting national needs, encourages education and 12 research, and recognizes the superior achievements of Engineering and the Health Care System engineers.
    [Show full text]
  • Optimizing a Bank of Kalman Filters for Navigation Integrity
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-2021 Optimizing a Bank of Kalman Filters for Navigation Integrity Luis E. Sepulveda Follow this and additional works at: https://scholar.afit.edu/etd Part of the Computer Sciences Commons, and the Navigation, Guidance, Control and Dynamics Commons Recommended Citation Sepulveda, Luis E., "Optimizing a Bank of Kalman Filters for Navigation Integrity" (2021). Theses and Dissertations. 4908. https://scholar.afit.edu/etd/4908 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. Optimizing Banks of Kalman Filters for Navigation Integrity using Parallel Computing and Efficient Software Design THESIS Luis E. Sepulveda, Captain, USAF AFIT-ENG-MS-21-M-079 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio DISTRIBUTION STATEMENT A APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in this document are those of the author and do not reflect the official policy or position of the United States Air Force, the United States Department of Defense or the United States Government. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENG-MS-21-M-079 OPTIMIZING BANKS OF KALMAN FILTERS FOR NAVIGATION INTEGRITY USING PARALLEL COMPUTING AND EFFICIENT SOFTWARE DESIGN THESIS Presented to the Faculty Department of Electrical and Computer Engineering Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science Luis E.
    [Show full text]
  • Ghosh Wsu 0251E 12693.Pdf (9.791Mb)
    SUPPORTING EFFICIENT GRAPH ANALYTICS AND SCIENTIFIC COMPUTATION USING ASYNCHRONOUS DISTRIBUTED-MEMORY PROGRAMMING MODELS By SAYAN GHOSH A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY WASHINGTON STATE UNIVERSITY School of Electrical Engineering and Computer Science MAY 2019 c Copyright by SAYAN GHOSH, 2019 All Rights Reserved c Copyright by SAYAN GHOSH, 2019 All Rights Reserved To the Faculty of Washington State University: The members of the Committee appointed to examine the dissertation of SAYAN GHOSH find it satisfactory and recommend that it be accepted. Assefaw H. Gebremedhin, Ph.D., Chair Carl Hauser, Ph.D. Ananth Kalyanaraman, Ph.D. Pavan Balaji, Ph.D. Mahantesh Halappanavar, Ph.D. ii ACKNOWLEDGEMENT I thank my adviser, Dr. Assefaw Gebremedhin for his generous guidance, unflagging support, and considerable enthusiasm toward my research. I greatly appreciate his attempts in always push- ing me to refine my writing and narration skills, which has helped me to become a better researcher and communicator. I would like to thank Dr. Jeff Hammond for introducing me to one-sided communication models, which play an important role in my thesis. I would also like to thank Dr. Barbara Chapman and Dr. Sunita Chandrasekaran, for their unwavering support during my Masters studies at the University of Houston. I am immensely fortunate to have had the opportunity to work with all of my thesis committee members. As a Teaching Assistant to Dr. Carl Hauser for the Computer Networks course, I appreciate that he encouraged me to solve the problem sets on my own, so that I could assist the students effectively.
    [Show full text]
  • About C++ And... Few More Things
    INTERVIEW Bjarne Stroustrup About C++ and... few more things Bjarne Stroustrup: Born December 30, 1950 in Århus, ( Denmark) He is a computer scientist, most notable for the creation and the development of the widely used C++ programming language. He is currently Professor and holder of the College of Engineering Chair in Computer Science at Texas A&M University C++ is undoubtedly one of the most successful two papers from the ACM History of Programming Lan- programming languages of our era. I know guages conference (HOPL). They are available from my You heard this question many times but today, publications page. looking from almost 30 years perspective, could you say what are in your opinion the What about C compatibility? Is C greatest advantages and disadvanta ges of compatibility a good for C++? this language? From today’s perspective what I decided to build C++ on the fo undation of some exi- would you change/redesign in C++? sting programming language. Si mula67 set an example by There are two ways of approaching this question: building on Algol and I really didn’t want to re-invent the wheel and make the usual set of beginner’s mistakes. I ne- • If I had a time machine and could go back to 1979 eded to build on a systems programming language becau- and start over, what would I have done differently? se my aim was to deal with the increasing complexity of • What would I like to change today? system programs arising from the huge increase in pro- cessor speeds and memory capacities.
    [Show full text]
  • The Political Ascendance of the English Language in Computer Programming
    Talking to Machines: The Political Ascendance of the English Language in Computer Programming by Ejilayomi Mimiko B.A. (History), Simon Fraser University, 2018 Extended Essay Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Arts in the School of Communication (Dual Degree Program in Global Communication) Faculty of Communication, Art and Technology © Ejilayomi Mimiko 2019 SIMON FRASER UNIVERSITY Summer 2019 Copyright in this Work rests With the author. Please ensure that any reproduction or re-use is done in accordance With the relevant national copyright legislation. Approval Name: Ejilayomi Mimiko Degree: Master of Arts Title: Talking to Machines: The Political Ascendance of the English Language in Computer Programming Supervisory Committee: Program Director Katherine Reilly, Professor Yuezhi Zhao Senior Supervisor Professor Katherine Reilly Program Director Associate Professor Date Approved: 29th August, 2019. ii Abstract This essay explores possible reasons Why English has become the "default" natural language from Which programming commands are borroWed. Programming languages like C, C++, Java and Python use English keywords exclusively. The essay explores the social factors that underlie this phenomenon and how traditional poWer hierarchies are perpetuated. The essay is a critical response to the emancipatory rhetoric that ushered in the creation and popularization of the digital computer. It uses the story of ALGOL project to illustrate how technical goals are shaped by social factors Which inevitably reify inequality into technological artefacts. ALGOL, an attempt to create a standardized machine independent universal programming language, While answering a significant amount of technical questions, did not bridge the natural language gap. By Way of historical exploration, I argue this result is an expression of American globalization of the computing industry.
    [Show full text]
  • The Design of C++0X Reinforcing C++’S Proven Strengths, While Moving Into the Future
    Bjarne Stroustrup The Design of C++0x Reinforcing C++’s proven strengths, while moving into the future nce or twice a day, I get e-mail sug- about every computer and operation system to teach and most programmers would settle gesting improvements to C++ [1, 2]. there is, work in just about every application into a small zone of comfort eschewing most O Many suggestions are good in the area there is, and in every country on earth. new features. It would be extremely difficult sense that if one became part of the language This implies a diversity of needs and wishes, to maintain the zero-overhead principle, partly or the Standard Library, it would make life and to me it implies that the further evolution because the implementation effort would be easier for a large number of programmers. must be guided by a set of general principles immense, partly because the implementation The suggestions are, of course, not all unique, to avoid accidentally damaging a of different features would interact, and partly so my suggestion collection contains “only” subcommunity in the quest for improvements because many suggestions don’t consider a hundred or so good ideas. The count de- for some other subcommunity. performance and rely on elaborate runtime pends on how you cluster related suggestions. In this article, I examine the main principles mechanisms. This, of course, presupposes that You can see an incomplete list of suggested we use to guide the development of C++0x, the implementer community would accept language features at http://www.research.att the next version of the C++ Standard.
    [Show full text]