高阶模式的功能统一

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI:10.1109/LICS.1993.287599

T. Nipkom

{"title":"高阶模式的功能统一","authors":"T. Nipkom","doi":"10.1109/LICS.1993.287599","DOIUrl":null,"url":null,"abstract":"The complete development of a unification algorithm for so-called higher-order patterns, a subclass of lambda -terms, is presented. The starting point is a formulation of unification by transformation, and the result a directly executable functional program. In a final development step, the result is adapted to lambda -terms in de Bruijn's (1972) notation. The algorithms work for both simply typed and untyped terms. >","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"18 1","pages":"64-74"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"103","resultStr":"{\"title\":\"Functional unification of higher-order patterns\",\"authors\":\"T. Nipkom\",\"doi\":\"10.1109/LICS.1993.287599\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The complete development of a unification algorithm for so-called higher-order patterns, a subclass of lambda -terms, is presented. The starting point is a formulation of unification by transformation, and the result a directly executable functional program. In a final development step, the result is adapted to lambda -terms in de Bruijn's (1972) notation. The algorithms work for both simply typed and untyped terms. >\",\"PeriodicalId\":6322,\"journal\":{\"name\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"18 1\",\"pages\":\"64-74\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"103\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1993.287599\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1993.287599","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 103

摘要

给出了所谓的高阶模式的统一算法的完整发展，这是λ -项的一个子类。出发点是通过转换统一的表述，结果是一个直接可执行的功能程序。在最后的开发步骤中，结果适应于de Bruijn(1972)符号中的lambda -项。该算法适用于简单类型和非类型的术语。>

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

查看原文本刊更多论文

Functional unification of higher-order patterns

The complete development of a unification algorithm for so-called higher-order patterns, a subclass of lambda -terms, is presented. The starting point is a formulation of unification by transformation, and the result a directly executable functional program. In a final development step, the result is adapted to lambda -terms in de Bruijn's (1972) notation. The algorithms work for both simply typed and untyped terms. >

求助全文

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

来源期刊

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量