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.
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.
Copy
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
Copy
@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},}
Copy
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 -