Descendants and Head Normalization of Higher-Order Rewrite Systems

Authors:
Hideto Kasuya;Masahiko Sakai;Kiyoshi Agusa
Affiliations:
-;-;-
Venue:
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Year:
2002

Citing 7
Cited 0

A theory of binding structures and applications to rewriting

Theoretical Computer Science
Call by need computations to root-stable form

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order rewrite systems and their confluence

Theoretical Computer Science - Special issue: rewriting systems and applications
Term rewriting and all that

Term rewriting and all that
Rewrite orderings for higher-order terms in n-long &bgr;-normal form and the recursive path ordering

Theoretical Computer Science - Special issue on rewriting techniques and applications
Orthogonal Higher-Order Rewrite Systems are Confluent

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Decidable Call by Need Computations in term Rewriting (Extended Abstract)

CADE-14 Proceedings of the 14th International Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an extension of head-needed rewriting on term rewriting systems to higher-order rewrite systems. The main difficulty of this extension is caused by the 脽-reductions induced from the higher-order reductions. In order to overcome this difficulty, we define a new descendant of higher-order rewrite systems. This paper shows the new definition of descendant, its properties and head normalization of head-needed rewriting on orthogonal higher-order rewrite systems.