在设计统一算法中使用类型:两个案例研究

UNIF Pub Date : 2014-07-28 DOI:10.29007/lbk5

Serdar Erbatur, Santiago Escobar, P. Narendran

{"title":"在设计统一算法中使用类型:两个案例研究","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":"{\"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}","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

摘要

在设计统一算法时，我们讨论非严格意义上的类型系统的使用。本文首先给出了El-Gamal签名方案的等式理论的一个新的(基于规则的)算法，并展示了如何使用类型系统来证明该算法的终止性。最后，我们给出了部分幂理论的终止结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The use of types in designing unification algorithms: two case studies

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

UNIF

自引率

0.00%

发文量

期刊最新文献

Some Notes on Basic Syntactic Mutation The use of types in designing unification algorithms: two case studies Recent Advances in Unification for the EL Family Bounded Higher-order Unification using Regular Terms Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis