无类型λ -微积分的有效最长和无限约简路径

{"title":"无类型λ -微积分的有效最长和无限约简路径","authors":"M. Sørensen","doi":"10.1007/3-540-61064-2_44","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi\",\"authors\":\"M. Sørensen\",\"doi\":\"10.1007/3-540-61064-2_44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":332808,\"journal\":{\"name\":\"Colloquium on Trees in Algebra and Programming\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Colloquium on Trees in Algebra and Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-61064-2_44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Colloquium on Trees in Algebra and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-61064-2_44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}