English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/155170
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Higher-Order Pattern Anti-Unification in Linear Time

AuthorsBaumgartner, Alexander; Kutsia, Temur; Levy, Jordi ; Villaret, Mateu
KeywordsGeneralizations of lambda terms
Higher-order patterns
Issue Date2017
CitationJournal of Automated Reasoning 58: 293- 310 (2017)
AbstractWe present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which computes a least general higher-order pattern generalization. For a pair of arbitrary terms of the same type, such a generalization always exists and is unique modulo α-equivalence and variable renaming. With a minor modification, the algorithm works for untyped lambda-terms as well. The time complexity of both algorithms is linear.
Identifiersdoi: 10.1007/s10817-016-9383-3
issn: 1573-0670
uri: https://link.springer.com/article/10.1007/s10817-016-9383-3
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
JAR(2017)_58(2)293-310.pdf393,11 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.