The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Propomos uma estratégia de correspondência sob demanda definida pelo usuário, chamada O-matching, na qual os usuários podem controlar a ordem dos argumentos de correspondência de cada símbolo de operação. Em esquemas de correspondência comuns não é importante definir a ordem de correspondência, no entanto, em esquemas de correspondência sob demanda, é muito importante, uma vez que um termo de entrada pode ser alterado durante o processo de correspondência sob demanda. O-matching é adequado para combinar com a estratégia E, que é uma estratégia de redução definida pelo usuário na qual os usuários podem controlar a ordem de redução dos argumentos. Mostramos uma condição suficiente sob a qual a estratégia E com emparelhamento O é correta para formas normais de cabeça, ou seja, qualquer termo reduzido é uma forma normal de cabeça.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Masaki NAKAMURA, Kazuhiro OGATA, Kokichi FUTATSUGI, "User-Defined On-Demand Matching" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 7, pp. 1401-1411, July 2009, doi: 10.1587/transinf.E92.D.1401.
Abstract: We propose a user-defined on-demand matching strategy, called O-matching, in which users can control the order of matching arguments of each operation symbol. In ordinary matching schemes it is not important to set the order of matching, however, in on-demand matching schemes, it is very important since an input term may be changed while doing the on-demand matching process. O-matching is suitable to combine with the E-strategy, which is a user-defined reduction strategy in which users can control the order of reducing arguments. We show a sufficient condition under which the E-strategy with O-matching is correct for head normal forms, that is, any reduced term is a head normal form.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1401/_p
Copiar
@ARTICLE{e92-d_7_1401,
author={Masaki NAKAMURA, Kazuhiro OGATA, Kokichi FUTATSUGI, },
journal={IEICE TRANSACTIONS on Information},
title={User-Defined On-Demand Matching},
year={2009},
volume={E92-D},
number={7},
pages={1401-1411},
abstract={We propose a user-defined on-demand matching strategy, called O-matching, in which users can control the order of matching arguments of each operation symbol. In ordinary matching schemes it is not important to set the order of matching, however, in on-demand matching schemes, it is very important since an input term may be changed while doing the on-demand matching process. O-matching is suitable to combine with the E-strategy, which is a user-defined reduction strategy in which users can control the order of reducing arguments. We show a sufficient condition under which the E-strategy with O-matching is correct for head normal forms, that is, any reduced term is a head normal form.},
keywords={},
doi={10.1587/transinf.E92.D.1401},
ISSN={1745-1361},
month={July},}
Copiar
TY - JOUR
TI - User-Defined On-Demand Matching
T2 - IEICE TRANSACTIONS on Information
SP - 1401
EP - 1411
AU - Masaki NAKAMURA
AU - Kazuhiro OGATA
AU - Kokichi FUTATSUGI
PY - 2009
DO - 10.1587/transinf.E92.D.1401
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2009
AB - We propose a user-defined on-demand matching strategy, called O-matching, in which users can control the order of matching arguments of each operation symbol. In ordinary matching schemes it is not important to set the order of matching, however, in on-demand matching schemes, it is very important since an input term may be changed while doing the on-demand matching process. O-matching is suitable to combine with the E-strategy, which is a user-defined reduction strategy in which users can control the order of reducing arguments. We show a sufficient condition under which the E-strategy with O-matching is correct for head normal forms, that is, any reduced term is a head normal form.
ER -