{"title":"带列表的递归方案","authors":"James H. Morris","doi":"10.1145/800152.804894","DOIUrl":null,"url":null,"abstract":"Scheme translation is used to compare the abilities of languages obtained by augmenting recursion schemes with lists, markers, and functional values. It is shown that the first two additions make orthogonal contributions to the language's power. Theorems 4 and 5 appear to be new results.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Recursion schemes with lists\",\"authors\":\"James H. Morris\",\"doi\":\"10.1145/800152.804894\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheme translation is used to compare the abilities of languages obtained by augmenting recursion schemes with lists, markers, and functional values. It is shown that the first two additions make orthogonal contributions to the language's power. Theorems 4 and 5 appear to be new results.\",\"PeriodicalId\":229726,\"journal\":{\"name\":\"Proceedings of the fourth annual ACM symposium on Theory of computing\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fourth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800152.804894\",\"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 fourth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800152.804894","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheme translation is used to compare the abilities of languages obtained by augmenting recursion schemes with lists, markers, and functional values. It is shown that the first two additions make orthogonal contributions to the language's power. Theorems 4 and 5 appear to be new results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
