Outside-In Conditional Narrowing
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1994-06-25
著者
-
IDA Tetsuo
Institute of Information Sciences and Electronics, University of Tsukuba
-
Ida Tetsuo
Institute Of Information Sciences And Electronics University Of Tsukuba
-
Okui Satoshi
Institute of Information Sciences and Electronics, University of Tsukuba
-
Okui Satoshi
Institute Of Information Sciences And Electronics University Of Tsukuba
関連論文
- Deterministic and Non-deterministic Lazy Conditional Narrowing and their Implementations
- Abstract Machine Approach to Operational Semantics of Prolog
- Collaborative Constraint Functional Logic Programming System in an Open Environment(Regular Section)
- Overflow Free and Variable Precision Computing in FLATS
- Overview of MC/LISP System
- Outside-In Conditional Narrowing
- Parallel Hash Algorithms for Virtual Key Index Tables
- Analysis of Parallel Hashing Algorithms with Key Deletion