Item


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

Author: Baumgartner, Alexander
Kutsia, Temur
Levy, Jordi
Villaret i Ausellé, Mateu
Abstract: 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
Document access: http://hdl.handle.net/2072/294832
Language: eng
Publisher: Dagstuhl Publishing
Rights: Attribution 3.0 Spain
Rights URI: http://creativecommons.org/licenses/by/3.0/es/
Subject: Algorismes computacionals
Computer algorithms
Lògica matemàtica
Logic, Symbolic and mathematical
Title: A Variant of Higher-Order Anti-Unification
Type: info:eu-repo/semantics/article
Repository: Recercat

Subjects

Authors


Warning: Unknown: write failed: No space left on device (28) in Unknown on line 0

Warning: Unknown: Failed to write session data (files). Please verify that the current setting of session.save_path is correct (/var/lib/php5) in Unknown on line 0