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/5032

Title: Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
Authors: Khasidashvili, Zurab
Ogawa, Mizuhito
Oostrom, Vincent van
Issue Date: 2001-01-10
Publisher: Academic Press(Elsevier)
Magazine name: Information and Computation
Volume: 164
Number: 1
Start page: 118
End page: 151
DOI: 10.1006/inco.2000.2888
Abstract: We study perpetuality of reduction steps, as well as perpetuality of redexes, in orthogonal rewrite systems. A perpetual step is a reduction step which retains the possibility of infinite reductions. A perpetual redex is a redex which, when put into an arbitrary context, yields a perpetual step. We generalize and refine existing criteria for the perpetuality of reduction steps and redexes in orthogonal Term Rewriting Systems and the λ-calculus due to Bergstra and Klop and others. We first introduce Context-sensitive Conditional Expression Reduction Systems (CCERSs) and define a concept of orthogonality (which implies confluence) for them. In particular, several important λ-calculi and their extensions and restrictions can naturally be embedded into orthogonal CCERSs. We then define a perpetual reduction strategy which enables one to construct minimal (w.r.t. Levy's permutation ordering on reductions) infinite reductions in orthogonal fully-extended CCERSs. Using the properties of the minimal perpetual strategy, we prove 1. perpetuality of any reduction step that does not erase potentially infinite arguments, which are arguments that may become, via substitution, infinite after a number of outside steps, and 2. perpetuality (in every context) of any safe redex, which is a redex whose substitution instances may discard infinite arguments only when the corresponding contracta remain infinite. We prove both these perpetuality criteria for orthogonal fully-extended CCERSs and then specialize and apply them to restricted λ-calculi, demonstrating their usefulness. In particular, we prove the equivalence of weak and strong normalization (which equivalence is here called uniform normalization) for various restricted λ-calculi, most of which cannot be derived from previously known perpetuality criteria.
Rights: NOTICE: This is the author's version of a work accepted for publication by Academic Press(Elsevier). Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom, Information and Computation, 164(1), 2001, 118-151, http://dx.doi.org/10.1006/inco.2000.2888
URI: http://hdl.handle.net/10119/5032
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
C2249.pdf530KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology