{"title":"Ada中抽象数据类型编程的一种方法","authors":"M. Sherman, Andy Hisgen, Jonathan Rosenberg","doi":"10.1145/3304133.3304143","DOIUrl":null,"url":null,"abstract":"We develop conventions to be followed when creating abstract data types in Ada. These conventions define a discipline for the use of initialization, finalization, assignment, private types, and generic packages in writing transportable and interchangeable abstract data types. We illustrate the conventions by presenting several implementations of an Ada package for a typical abstract data type, Set. The implications of these conventions for compiler implementation are discussed.","PeriodicalId":304626,"journal":{"name":"Proceedings of the AdaTEC Conference on Ada","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A methodology for programming abstract data types in Ada\",\"authors\":\"M. Sherman, Andy Hisgen, Jonathan Rosenberg\",\"doi\":\"10.1145/3304133.3304143\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop conventions to be followed when creating abstract data types in Ada. These conventions define a discipline for the use of initialization, finalization, assignment, private types, and generic packages in writing transportable and interchangeable abstract data types. We illustrate the conventions by presenting several implementations of an Ada package for a typical abstract data type, Set. The implications of these conventions for compiler implementation are discussed.\",\"PeriodicalId\":304626,\"journal\":{\"name\":\"Proceedings of the AdaTEC Conference on Ada\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the AdaTEC Conference on Ada\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3304133.3304143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the AdaTEC Conference on Ada","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3304133.3304143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A methodology for programming abstract data types in Ada
We develop conventions to be followed when creating abstract data types in Ada. These conventions define a discipline for the use of initialization, finalization, assignment, private types, and generic packages in writing transportable and interchangeable abstract data types. We illustrate the conventions by presenting several implementations of an Ada package for a typical abstract data type, Set. The implications of these conventions for compiler implementation are discussed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
