{"title":"一种程序员控制的数据和控制抽象方法","authors":"J. Heinänen","doi":"10.1145/800226.806850","DOIUrl":null,"url":null,"abstract":"Traditionally, data abstraction languages have only provided a means to extend the language “upward” to include new procedures and data types not present in the base language. This paper introduces a complementary approach, which also allows programmers to extend the language “downward” and thus to override many of the previously preempted decisions concerning the nature and implementation of various language constructs. In order to illustrate the approach, several extension examples are presented that involve control of decisions below the level of Pascal-like languages. Implementation of the programmer defined language constructs is also discussed and benchmark results are reported that show them comparable—and in many cases exceeding—in efficiency the corresponding built-in constructs of conventional languages.","PeriodicalId":414056,"journal":{"name":"SIGPLAN Conferences and Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1983-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A programmer controlled approach to data and control abstraction\",\"authors\":\"J. Heinänen\",\"doi\":\"10.1145/800226.806850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditionally, data abstraction languages have only provided a means to extend the language “upward” to include new procedures and data types not present in the base language. This paper introduces a complementary approach, which also allows programmers to extend the language “downward” and thus to override many of the previously preempted decisions concerning the nature and implementation of various language constructs. In order to illustrate the approach, several extension examples are presented that involve control of decisions below the level of Pascal-like languages. Implementation of the programmer defined language constructs is also discussed and benchmark results are reported that show them comparable—and in many cases exceeding—in efficiency the corresponding built-in constructs of conventional languages.\",\"PeriodicalId\":414056,\"journal\":{\"name\":\"SIGPLAN Conferences and Workshops\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1983-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGPLAN Conferences and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800226.806850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGPLAN Conferences and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800226.806850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A programmer controlled approach to data and control abstraction
Traditionally, data abstraction languages have only provided a means to extend the language “upward” to include new procedures and data types not present in the base language. This paper introduces a complementary approach, which also allows programmers to extend the language “downward” and thus to override many of the previously preempted decisions concerning the nature and implementation of various language constructs. In order to illustrate the approach, several extension examples are presented that involve control of decisions below the level of Pascal-like languages. Implementation of the programmer defined language constructs is also discussed and benchmark results are reported that show them comparable—and in many cases exceeding—in efficiency the corresponding built-in constructs of conventional languages.