闭标称改写与高效可计算的标称代数等式

International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice Pub Date : 2010-09-14 DOI:10.4204/EPTCS.34.5

M. Fernández, M. Gabbay

{"title":"闭标称改写与高效可计算的标称代数等式","authors":"M. Fernández, M. Gabbay","doi":"10.4204/EPTCS.34.5","DOIUrl":null,"url":null,"abstract":"We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of the lambda-calculus and first-order logic.","PeriodicalId":262518,"journal":{"name":"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Closed nominal rewriting and efficiently computable nominal algebra equality\",\"authors\":\"M. Fernández, M. Gabbay\",\"doi\":\"10.4204/EPTCS.34.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of the lambda-calculus and first-order logic.\",\"PeriodicalId\":262518,\"journal\":{\"name\":\"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.34.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.34.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 23

摘要

我们分析了名义代数与名义改写之间的关系，给出了名义理论中方程演绎的一种新的、简明的表述。利用一些新的结果，我们刻画了方程理论的一个子类，对于这个子类，标称改写提供了一个检验标称代数等式的完整过程。这个子类包括lambda演算和一阶逻辑的规范。

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

查看原文本刊更多论文

Closed nominal rewriting and efficiently computable nominal algebra equality

We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of the lambda-calculus and first-order logic.

求助全文

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

来源期刊

International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

自引率

0.00%

发文量