{"title":"The use of types in designing unification algorithms: two case studies","authors":"Serdar Erbatur, Santiago Escobar, P. Narendran","doi":"10.29007/lbk5","DOIUrl":null,"url":null,"abstract":"We discuss the use of type systems in a non-strict sense when designing uni cation algorithms. We rst give a new (rule-based) algorithm for an equational theory which represents a property of El-Gamal signature schemes and show how a type system can be used to prove termination of the algorithm. Lastly, we reproduce a termination result for theory of partial exponentiation given earlier.","PeriodicalId":164988,"journal":{"name":"UNIF","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"UNIF","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/lbk5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We discuss the use of type systems in a non-strict sense when designing uni cation algorithms. We rst give a new (rule-based) algorithm for an equational theory which represents a property of El-Gamal signature schemes and show how a type system can be used to prove termination of the algorithm. Lastly, we reproduce a termination result for theory of partial exponentiation given earlier.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
