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.2016.11
URN: urn:nbn:de:0030-drops-59832
URL: https://drops.dagstuhl.de/opus/volltexte/2016/5983/
Ayala-Rincón, Mauricio ; Fernández, Maribel ; Nantes-Sobrinho, Daniele
Nominal Narrowing
| pdf-format: |
|
Abstract
Nominal unification is a generalisation of first-order unificationthat takes alpha-equivalence into account. In this paper, we study
nominal unification in the context of equational theories. We
introduce nominal narrowing and design a general nominal E-unification
procedure, which is sound and complete for a wide class of equational
theories. We give examples of application.
BibTeX - Entry
@InProceedings{ayalarincn_et_al:LIPIcs:2016:5983,
author = {Mauricio Ayala-Rinc{\'o}n and Maribel Fern{\'a}ndez and Daniele Nantes-Sobrinho},
title = {{Nominal Narrowing}},
booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-010-1},
ISSN = {1868-8969},
year = {2016},
volume = {52},
editor = {Delia Kesner and Brigitte Pientka},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5983},
URN = {urn:nbn:de:0030-drops-59832},
doi = {10.4230/LIPIcs.FSCD.2016.11},
annote = {Keywords: Nominal Rewriting, Nominal Unification, Matching, Narrowing, Equational Theories}
}
| Keywords: | Nominal Rewriting, Nominal Unification, Matching, Narrowing, Equational Theories | |
| Seminar: | 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 17.06.2016 |
