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

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

DC FieldValueLanguage
dc.contributor.authorBaumgartner, Alexander-
dc.contributor.authorKutsia, Temur-
dc.contributor.authorLevy, Jordi-
dc.contributor.authorVillaret, Mateu-
dc.date.accessioned2016-06-09T16:45:25Z-
dc.date.available2016-06-09T16:45:25Z-
dc.date.issued2013-06-24-
dc.identifierdoi: 10.4230/LIPIcs.RTA.2013.113-
dc.identifierissn: 18688969-
dc.identifierisbn: 978-393989753-8-
dc.identifier.citation24th International Conference on Rewriting Techniques and Applications, RTA 2013; Eindhoven; Netherlands; 24 June 2013 through 26 June 2013. Leibniz International Proceedings in Informatics, LIPIcs, vol. 21, 2013, pp. 113-127-
dc.identifier.urihttp://hdl.handle.net/10261/133270-
dc.description.abstractWe present a rule-based Huet's style anti-unification algorithm for simply-typed lambda-terms in η-long -normal form, 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. The algorithm computes it in cubic time within linear space. It has been implemented and the code is freely available. © Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret; licensed under Creative Commons License CC-BY 24th International Conference on Rewriting Techniques and Applications (RTA'13).-
dc.description.sponsorshipThis research has been partially supported by the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the Austrian Science Fund (FWF) with the project SToUT (P 24087-N18) and by the Generalitat de Catalunya with the grant AGAUR 2009-SGR-1434.-
dc.relation.isversionofPostprint-
dc.rightsopenAccess-
dc.subjectHigher-order anti-unification-
dc.subjectHigher-order patterns-
dc.titleA Variant of Higher-Order Anti-Unification-
dc.typecomunicación de congreso-
dc.identifier.doi10.4230/LIPIcs.RTA.2013.113-
dc.date.updated2016-06-09T16:45:26Z-
dc.description.versionPeer Reviewed-
dc.language.rfc3066eng-
dc.contributor.funderGeneralitat de Catalunya-
dc.contributor.funderMinisterio de Economía y Competitividad (España)-
dc.identifier.funderhttp://dx.doi.org/10.13039/501100002809es_ES
dc.identifier.funderhttp://dx.doi.org/10.13039/501100003329es_ES
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
LIPIcs.v21.2013.113-27.pdf489,1 kBUnknownView/Open
Show simple item record
 


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