The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems

The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems (1994)

Cached

Download Links

[www.cs.bgu.ac.il]
[www.sys.uea.ac.uk]

Other Repositories/Bibliography

DBLP

by Zurab Khasidashvili

Venue:	In: Proc. of the 3 rd International Conference on Logical Foundations of Computer Science, LFCS'94, A. Nerode and Yu.V. Matiyasevich, eds., Springer LNCS
Citations:	18 - 8 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems	user correction - Legacy Corrections
AUTHOR NAME	Zurab Khasidashvili	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Information Systems, UEA	SVM HeaderParse 0.2
AUTHOR ADDR	Norwich NR4 7TJ England	SVM HeaderParse 0.1
ABSTRACT	We consider reductions in Orthogonal Expression Reduction Systems (OERS), that is, Orthogonal Term Rewriting Systems with bound variables and substitutions, as in the -calculus. We design a strategy that for any given term t constructs a longest reduction starting from t if t is strongly normalizable, and constructs an infinite reduction otherwise. The Conservation Theorem for OERSs follows easily from the properties of the strategy. We develop a method for computing the length of a longest reduction starting from a strongly normalizable term. We study properties of pure substitutions and several kinds of similarity of redexes. We apply these results to construct an algorithm for computing lengths of longest reductions in strongly persistent OERSs that does not require actual transformation of the input term. As a corollary, we have an algorithm for computing lengths of longest developments in OERSs. 1 Introduction A strategy is perpetual if, given a term t, it constructs an infinit...	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	In: Proc. of the 3 rd International Conference on Logical Foundations of Computer Science, LFCS'94, A. Nerode and Yu.V. Matiyasevich, eds., Springer LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	191--203	INFERENCE
VOLUME	813	INFERENCE
CITATIONS	17 found	ParsCit 1.0