{"title":"更快的组合器减少使用库存硬件","authors":"A. Norman","doi":"10.1145/62678.62716","DOIUrl":null,"url":null,"abstract":"When originally introduced by Turner [I], the S-K combinators seemed a very attractive basis for the execution of functional programs. In current implementations of languages it is becoming increasingly uncommon to find them used, since it has been found that them are many optimization techniques available [I, 31 that rely on illustrated that streamlined implementations of small instruction sets may compete quite well with even competent professionally built implementations of more complicated computational models,","PeriodicalId":119710,"journal":{"name":"Proceedings of the 1988 ACM conference on LISP and functional programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Faster combinator reduction using stock hardware\",\"authors\":\"A. Norman\",\"doi\":\"10.1145/62678.62716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When originally introduced by Turner [I], the S-K combinators seemed a very attractive basis for the execution of functional programs. In current implementations of languages it is becoming increasingly uncommon to find them used, since it has been found that them are many optimization techniques available [I, 31 that rely on illustrated that streamlined implementations of small instruction sets may compete quite well with even competent professionally built implementations of more complicated computational models,\",\"PeriodicalId\":119710,\"journal\":{\"name\":\"Proceedings of the 1988 ACM conference on LISP and functional programming\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1988 ACM conference on LISP and functional programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/62678.62716\",\"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 1988 ACM conference on LISP and functional programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/62678.62716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
When originally introduced by Turner [I], the S-K combinators seemed a very attractive basis for the execution of functional programs. In current implementations of languages it is becoming increasingly uncommon to find them used, since it has been found that them are many optimization techniques available [I, 31 that rely on illustrated that streamlined implementations of small instruction sets may compete quite well with even competent professionally built implementations of more complicated computational models,