{"title":"一类视觉语言的效率问题","authors":"M. Burnett, A. Ambler","doi":"10.1109/WVL.1990.128408","DOIUrl":null,"url":null,"abstract":"A class of visual programming languages whose members share a common group of underlying principles is identified. In this class (the demand-driven temporal-assignment visual language model), the elimination of certain duplicate computations is a natural by-product of the model. The potential time and space complexity characteristics for visual languages based on this model are discussed, and a method that makes use of these characteristics is presented.<<ETX>>","PeriodicalId":256667,"journal":{"name":"Proceedings of the 1990 IEEE Workshop on Visual Languages","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficiency issues in a class of visual language\",\"authors\":\"M. Burnett, A. Ambler\",\"doi\":\"10.1109/WVL.1990.128408\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A class of visual programming languages whose members share a common group of underlying principles is identified. In this class (the demand-driven temporal-assignment visual language model), the elimination of certain duplicate computations is a natural by-product of the model. The potential time and space complexity characteristics for visual languages based on this model are discussed, and a method that makes use of these characteristics is presented.<<ETX>>\",\"PeriodicalId\":256667,\"journal\":{\"name\":\"Proceedings of the 1990 IEEE Workshop on Visual Languages\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1990 IEEE Workshop on Visual Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WVL.1990.128408\",\"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 1990 IEEE Workshop on Visual Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WVL.1990.128408","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A class of visual programming languages whose members share a common group of underlying principles is identified. In this class (the demand-driven temporal-assignment visual language model), the elimination of certain duplicate computations is a natural by-product of the model. The potential time and space complexity characteristics for visual languages based on this model are discussed, and a method that makes use of these characteristics is presented.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
