Confluence Property of Simple Frames in Dynamic Term Rewriting Calculus
Summary :
Dynamic Term Rewriting Calculus is a new computation model proposed by the authors for the purpose of formal description and verification of algorithms treating Term Rewriting Systems. The computation of DTRC is basically term rewriting. The characteristic features of DTRC are dynamic change of rewriting rules during computation and hierarchical declaration of not only function symbols and variables but also rewriting rules. These features allow us to program metacomputation of TRSs in DTRC, that is , we can implement in DTRC in a natural way those algorithms which manipulate term rewriting systems as well as those procedures which verify such algorithms. In this paper, we give a formal description of DTRC. We then show some results on confluence property of DTRC.
- Publication
- IEICE TRANSACTIONS on Information Vol.E80-D No.6 pp.625-645
- Publication Date
- 1997/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Automata,Languages and Theory of Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Su FENG, Toshiki SAKABE, Yasuyoshi INAGAKI, "Confluence Property of Simple Frames in Dynamic Term Rewriting Calculus" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 6, pp. 625-645, June 1997, doi: .
Abstract: Dynamic Term Rewriting Calculus is a new computation model proposed by the authors for the purpose of formal description and verification of algorithms treating Term Rewriting Systems. The computation of DTRC is basically term rewriting. The characteristic features of DTRC are dynamic change of rewriting rules during computation and hierarchical declaration of not only function symbols and variables but also rewriting rules. These features allow us to program metacomputation of TRSs in DTRC, that is , we can implement in DTRC in a natural way those algorithms which manipulate term rewriting systems as well as those procedures which verify such algorithms. In this paper, we give a formal description of DTRC. We then show some results on confluence property of DTRC.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_6_625/_p
Copy
@ARTICLE{e80-d_6_625,
author={Su FENG, Toshiki SAKABE, Yasuyoshi INAGAKI, },
journal={IEICE TRANSACTIONS on Information},
title={Confluence Property of Simple Frames in Dynamic Term Rewriting Calculus},
year={1997},
volume={E80-D},
number={6},
pages={625-645},
abstract={Dynamic Term Rewriting Calculus is a new computation model proposed by the authors for the purpose of formal description and verification of algorithms treating Term Rewriting Systems. The computation of DTRC is basically term rewriting. The characteristic features of DTRC are dynamic change of rewriting rules during computation and hierarchical declaration of not only function symbols and variables but also rewriting rules. These features allow us to program metacomputation of TRSs in DTRC, that is , we can implement in DTRC in a natural way those algorithms which manipulate term rewriting systems as well as those procedures which verify such algorithms. In this paper, we give a formal description of DTRC. We then show some results on confluence property of DTRC.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Confluence Property of Simple Frames in Dynamic Term Rewriting Calculus
T2 - IEICE TRANSACTIONS on Information
SP - 625
EP - 645
AU - Su FENG
AU - Toshiki SAKABE
AU - Yasuyoshi INAGAKI
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1997
AB - Dynamic Term Rewriting Calculus is a new computation model proposed by the authors for the purpose of formal description and verification of algorithms treating Term Rewriting Systems. The computation of DTRC is basically term rewriting. The characteristic features of DTRC are dynamic change of rewriting rules during computation and hierarchical declaration of not only function symbols and variables but also rewriting rules. These features allow us to program metacomputation of TRSs in DTRC, that is , we can implement in DTRC in a natural way those algorithms which manipulate term rewriting systems as well as those procedures which verify such algorithms. In this paper, we give a formal description of DTRC. We then show some results on confluence property of DTRC.
ER -
English
