Ítem


A Variant of Higher-Order Anti-Unification

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

Dagstuhl Publishing

Autor: Baumgartner, Alexander
Kutsia, Temur
Levy, Jordi
Villaret i Ausellé, Mateu
Resum: 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
Accés al document: http://hdl.handle.net/2072/294832
Llenguatge: eng
Editor: Dagstuhl Publishing
Drets: Attribution 3.0 Spain
URI Drets: http://creativecommons.org/licenses/by/3.0/es/
Matèria: Algorismes computacionals
Computer algorithms
Lògica matemàtica
Logic, Symbolic and mathematical
Títol: A Variant of Higher-Order Anti-Unification
Tipus: info:eu-repo/semantics/article
Repositori: Recercat

Matèries

Autors