The programming language Pascal is assessed in the light of `reliable programming' and with the background of five years of experience with the language. Some features are selected to point out ...remaining problems, either inherent or specific, from which some guidelines for the design of choice of languages for reliable programming are derived. Among the discussed features are the concept of data type, the sequential file structure and the type union.
The programming language PASCAL is assessed in the light of “reliable programming” and with the background of five years of experience with the language. Some features are selected to point out ...remaining problems, either inherent or specific, from which some guidelines for the design or choice of languages for reliable programming are derived. Among the discussed features are the concept of data type, the sequential file structure, and the type union.
The programming language PASCAL is assessed in the light of "reliable programming" and with the background of five years of experience with the language. Some features are selected to point out ...remaining problems, either inherent or specific, from which some guidelines for the design or choice of languages for reliable programming are derived. Among the discussed features are the concept of data type, the sequential file structure, and the type union.
Language Prescription Chapman, Don; Rawlins, Jacob D
2020, 2020-09-21, Letnik:
170
eBook
This book is a detailed examination of social connections to language evaluation with a specific focus on the values associated with both prescriptivism and descriptivism. The chapters, written by ...authors from many different linguistic and national backgrounds, use a variety of approaches and methods to discuss values in linguistic prescriptivism.
Domain-specific languages (DSLs) are often argued to have a simpler notation than general-purpose languages (GPLs), since the notation is adapted to the specific problem domain. Consequently, the ...impact of domain relevance on the creation of the problem representation is believed to improve programmers’ efficiency and accuracy when using DSLs compared with using similar solutions like application libraries in GPLs. Most of the common beliefs have been based upon qualitative conclusions drawn by developers. Rather than implementing the same problem in a DSL and in a GPL and comparing the efficiency and accuracy of each approach, developers often compare the implementation of a new program in a DSL to their previous experiences implementing similar programs in GPLs. Such a conclusion may or may not be valid. This paper takes a more skeptical approach to acceptance of those beliefs. By reporting on a family of three empirical studies comparing DSLs and GPLs in different domains. The results of the studies showed that when using a DSL, developers are more accurate and more efficient in program comprehension than when using a GPL. These results validate some of the long- held beliefs of the DSL community that until now were only supported by anecdotal evidence.
