Abstract: "We define Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the [lambda]-calculus) in right-hand sides of function and quantifier definitions. To study reductions in a HRPS we split it into 'first order part' and 'pure substitution par...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Khasidashvili, Zurab (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1993
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,48
Schlagworte:	Recursive programming Rewriting systems (Computer science)
Zusammenfassung:	Abstract: "We define Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the [lambda]-calculus) in right-hand sides of function and quantifier definitions. To study reductions in a HRPS we split it into 'first order part' and 'pure substitution part'. A study of pure substitutions and several kinds of similarity of redexes makes it possible to lift properties of (first order) Recursive Program Schemes to the higher order case. The crucial properties are that corresponding arguments of essentially similar redexes are either both essential or both inessential, and that essentially similar redexes create essentially similar redexes The main result is the decidability of weak normalization in HRPSs, which immediately implies that HRPSs do not have full computational power. We analyze the structural properties of HRPSs and introduce several kinds of persistent higher order rewrite systems that enjoy similar properties. For uniformly persistent systems, we design an efficient optimal sequential normalizing strategy.
Beschreibung:	17 S.