Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/155170COMPARTIR / EXPORTAR:
 SHARE
 CORE
BASE
|
|
| Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
| Título: | Higher-Order Pattern Anti-Unification in Linear Time |
Autor: | Baumgartner, Alexander; Kutsia, Temur; Levy, Jordi CSIC ORCID ; Villaret, Mateu | Palabras clave: | Generalizations of lambda terms Anti-unification Higher-order patterns |
Fecha de publicación: | 2017 | Editor: | Springer Nature | Citación: | Journal of Automated Reasoning 58: 293- 310 (2017) | Resumen: | We 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. | URI: | http://hdl.handle.net/10261/155170 | DOI: | 10.1007/s10817-016-9383-3 | Identificadores: | doi: 10.1007/s10817-016-9383-3 issn: 1573-0670 uri: https://link.springer.com/article/10.1007/s10817-016-9383-3 |
| Aparece en las colecciones: | (IIIA) Artículos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| JAR(2017)_58(2)293-310.pdf | 393,11 kB | Adobe PDF |  Visualizar/Abrir |
CORE Recommender
PubMed Central
Citations
1
checked on 22-abr-2024
SCOPUSTM
Citations
10
checked on 02-may-2024
WEB OF SCIENCETM
Citations
5
checked on 23-feb-2024
Page view(s)
260
checked on 05-may-2024
Download(s)
173
checked on 05-may-2024
