Outside-In Conditional Narrowing

Tetsuo IDA; Satoshi OKUI

Outside-In Conditional Narrowing

Tetsuo IDA, Satoshi OKUI

Full Text Views

0

Share
Cite this

Summary :

We present outside-in conditional narrowing for orthogonal conditional term rewriting systems, and show the completeness of leftmost-outside-in conditional narrowing with respect to normalizable solutions. We consider orthogonal conditional term rewriting systems whose conditions consist of strict equality only. Completeness results are obtained for systems both with and without extra variables. The result bears practical significance since orthogonal conditional term rewriting systems can be viewed as a computation model for functional-logic programming languages and leftmost-outside-in conditional narrowing is the computing mechanism for the model.

Publication: IEICE TRANSACTIONS on Information Vol.E77-D No.6 pp.631-641

Publication Date: 1994/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Automata, Languages and Theory of Computing

Cite this

Copy

Tetsuo IDA, Satoshi OKUI, "Outside-In Conditional Narrowing" in IEICE TRANSACTIONS on Information, vol. E77-D, no. 6, pp. 631-641, June 1994, doi: .
Abstract: We present outside-in conditional narrowing for orthogonal conditional term rewriting systems, and show the completeness of leftmost-outside-in conditional narrowing with respect to normalizable solutions. We consider orthogonal conditional term rewriting systems whose conditions consist of strict equality only. Completeness results are obtained for systems both with and without extra variables. The result bears practical significance since orthogonal conditional term rewriting systems can be viewed as a computation model for functional-logic programming languages and leftmost-outside-in conditional narrowing is the computing mechanism for the model.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e77-d_6_631/_p

Copy

@ARTICLE{e77-d_6_631,
author={Tetsuo IDA, Satoshi OKUI, },
journal={IEICE TRANSACTIONS on Information},
title={Outside-In Conditional Narrowing},
year={1994},
volume={E77-D},
number={6},
pages={631-641},
abstract={We present outside-in conditional narrowing for orthogonal conditional term rewriting systems, and show the completeness of leftmost-outside-in conditional narrowing with respect to normalizable solutions. We consider orthogonal conditional term rewriting systems whose conditions consist of strict equality only. Completeness results are obtained for systems both with and without extra variables. The result bears practical significance since orthogonal conditional term rewriting systems can be viewed as a computation model for functional-logic programming languages and leftmost-outside-in conditional narrowing is the computing mechanism for the model.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Outside-In Conditional Narrowing
T2 - IEICE TRANSACTIONS on Information
SP - 631
EP - 641
AU - Tetsuo IDA
AU - Satoshi OKUI
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E77-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1994
AB - We present outside-in conditional narrowing for orthogonal conditional term rewriting systems, and show the completeness of leftmost-outside-in conditional narrowing with respect to normalizable solutions. We consider orthogonal conditional term rewriting systems whose conditions consist of strict equality only. Completeness results are obtained for systems both with and without extra variables. The result bears practical significance since orthogonal conditional term rewriting systems can be viewed as a computation model for functional-logic programming languages and leftmost-outside-in conditional narrowing is the computing mechanism for the model.
ER -