Uniform Normalisation beyond Orthogonality
スポンサーリンク
概要
- 論文の詳細を見る
A rewrite system is called uniformly normalising if all its steps are perpetual, i.e. are such that if s → t and s has an infinite reduction, then t has one too. For such systems termination (SN) is equivalent to normalisation (WN). A well-known fact is uniform normalisation of orthogonal non-erasing term rewrite systems, e.g. the λI-calculus. In the present paper both restrictions are analysed. Orthogonality is seen to pertain to the linear part and non-erasingness to the non-linear part of rewrite steps. Based on this analysis, a modular proof method for uniform normalisation is presented which allows to go beyond orthogonality. The method is shown applicable to biclosed first- and second-order term rewrite systems as well as to a λ-calculus with explicit substitutions.
- Springerの論文
- 2001-00-00
Springer | 論文
- Comparisons of germination traits of alpine plants between fellfield and snowbed habitats
- Photoreceptor Images of Normal Eyes and of Eyes with Macular Dystrophy Obtained In Vivo with an Adaptive Optics Fundus Camera
- Effect of Electrical Stimulation on IGF-1 Transcription by L-Type Calcium Channels in Cultured Retinal Muller Cells
- In Vivo Measurements of Cone Photoreceptor Spacing in Myopic Eyes from Images Obtained by an Adaptive Optics Fundus Camera
- Optical Quality of the Eye Degraded by Time-Varying Wavefront Aberrations with Tear Film Dynamics