License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2019.10
URN: urn:nbn:de:0030-drops-105175
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10517/
Cerna, David M. ;
Kutsia, Temur
A Generic Framework for Higher-Order Generalizations
Abstract
We consider a generic framework for anti-unification of simply typed lambda terms. It helps to compute generalizations which contain maximally common top part of the input expressions, without nesting generalization variables. The rules of the corresponding anti-unification algorithm are formulated, and their soundness and termination are proved. The algorithm depends on a parameter which decides how to choose terms under generalization variables. Changing the particular values of the parameter, we obtained four new unitary variants of higher-order anti-unification and also showed how the already known pattern generalization fits into the schema.
BibTeX - Entry
@InProceedings{cerna_et_al:LIPIcs:2019:10517,
author = {David M. Cerna and Temur Kutsia},
title = {{A Generic Framework for Higher-Order Generalizations}},
booktitle = {4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-107-8},
ISSN = {1868-8969},
year = {2019},
volume = {131},
editor = {Herman Geuvers},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10517},
URN = {urn:nbn:de:0030-drops-105175},
doi = {10.4230/LIPIcs.FSCD.2019.10},
annote = {Keywords: anti-unification, typed lambda calculus, least general generalization}
}
Keywords: |
|
anti-unification, typed lambda calculus, least general generalization |
Collection: |
|
4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) |
Issue Date: |
|
2019 |
Date of publication: |
|
18.06.2019 |