Ítem
|
Baumgartner, Alexander
Kutsia, Temur Levy, Jordi Villaret i Ausellé, Mateu |
|
| We 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 | |
| http://hdl.handle.net/2072/218199 | |
| eng | |
| Dagstuhl Publishing | |
| Attribution 3.0 Spain | |
| http://creativecommons.org/licenses/by/3.0/es/ | |
|
Algorismes computacionals
Computer algorithms Lògica matemàtica Logic, Symbolic and mathematical |
|
| A Variant of Higher-Order Anti-Unification | |
| info:eu-repo/semantics/article | |
| Recercat |
