{"title":"»Nimm Zwei!«","authors":"U. Schimank","doi":"10.1515/9783839427255-003","DOIUrl":null,"url":null,"abstract":"We investigate properties of reductions of S-terms. The combinator S has the reduction rule S x y z ?! x z (y z). We prove that 1.) this rewriting system is top-terminating and 2.) admits no ground loops. Examples and conjectures are included as well.","PeriodicalId":117327,"journal":{"name":"Critical Realism meets kritische Sozialtheorie","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Critical Realism meets kritische Sozialtheorie","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/9783839427255-003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We investigate properties of reductions of S-terms. The combinator S has the reduction rule S x y z ?! x z (y z). We prove that 1.) this rewriting system is top-terminating and 2.) admits no ground loops. Examples and conjectures are included as well.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
