Skip to main content
Article thumbnail
Location of Repository

A proof of finite family developments for higher-order rewriting using a prefix property

By H.J.S. Bruggink


A prefix property is the property that, given a reduction, the\ud ancestor of a prefix of the target is a prefix of the source. In this paper we\ud prove a prefix property for the class of Higher-Order Rewriting Systems\ud with patterns (HRSs), by reducing it to a similar prefix property of a\ud λ-calculus with explicit substitutions. This prefix property is then used\ud to prove that Higher-order Rewriting Systems enjoy Finite Family Developments.\ud This property states, that reductions in which the creation\ud depth of the redexes is bounded are finite, and is a useful tool to prove\ud various properties of HRSs

Topics: Wijsbegeerte
Year: 2006
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.