The Completeness of Order-Sorted Term Rewriting Systems Is Preserved by Currying
スポンサーリンク
概要
- 論文の詳細を見る
The currying of term rewriting systems (TRSs) is a transformation of TRSs from a functional form to an applicative form. We have already introduced an order-sorted version of currying and proved that the compatibility and confluence of order-sorted TRSs were preserved by currying[3]. In this paper, we focus on a key property of TRSs, completeness. We first show some proofs omitted in Ref.[3]. Then, we prove that the SN (strongly normalizing) property, which corresponds to termination of a program, is preserved by currying. Finally, we prove that the completeness of compatible order-sorted TRSs is preserved by currying.
- 社団法人電子情報通信学会の論文
- 1997-03-25
著者
-
Kawabe Yoshinobu
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Kawabe Yoshinobu
The Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
ISHII Naohiro
Department of Intelligence and Computer Science, Nagoya Institute of Technology
-
Ishii Naohiro
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ishii Naohiro
Department Of Electrical Engineering And Computer Science Nagoya Institute Of Technology
関連論文
- The Completeness of Order-Sorted Term Rewriting Systems Is Preserved by Currying
- An Energy-Efficient Initialization Protocol for Wireless Sensor Networks with No Collision Detection
- Termination of Order-Sorted Rewriting with Non-minimal Signatures
- Accuracy of the Minimum Time Estimate for Programs on Heterogeneous Machines
- A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs (Special Issue on Parallel and Distributed Supercomputing)
- An Improved Increase over the Minimum Execution Time of a Parallel Program
- An Efficient Method for Computing All Reducts
- A Hybrid Method of Feature Subset Selection
- Improving Performance of the k-Nearest Neighbor Classifier by Combining Feature Selection with Feature Weighting
- Speeding up String Searching Algorithms for Nonuniform Texts
- On Relationships between Decomposable Programs and Rule Commutative Programs
- Efficient Evaluation of One-directional Cycle-recursive Formulas
- A Performance Measure for the Scheduling of Typed Task Systems with Communication Costs
- Decomposable Programs Revised
- Determining Feature Weight of Pattern Classification by Using Rough Genetic Algorithm and Fuzzy Similarity Measure
- Fast On-line String Searching
- Reliability of a Mobile Communication System with Network Congestion
- Optimizing Linear Recursive Formulas by Detaching Isolated Variables