JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/7875
|
Title: | Call-by-Need Reduction for Membership Conditional Term Rewriting Systems |
Authors: | Ogawa, Mizuhito |
Issue Date: | 2003-12 |
Publisher: | Elsevier |
Magazine name: | Electronic Notes in Theoretical Computer Science |
Volume: | 86 |
Number: | 4 |
Start page: | 673 |
End page: | 688 |
DOI: | 10.1016/S1571-0661(05)82617-9 |
Abstract: | This paper proves that, for a normal membership conditional term rewriting system (MCTRS), (1) a reducible term has a needed redex if the MCTRS is nonoverlapping, and (2) whether a redex is nv-needed is decidable. |
Rights: | NOTICE: This is the author's version of a work accepted for publication by Elsevier. Mizuhito Ogawa , Electronic Notes in Theoretical Computer Science, 86(4), 2003, 673-688, http://dx.doi.org/10.1016/S1571-0661(05)82617-9 |
URI: | http://hdl.handle.net/10119/7875 |
Material Type: | author |
Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
File |
Description |
Size | Format |
ENTCS03.pdf | | 145Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|