Higher-Order Equational Reasoning

  • Christian Prehofer
Part of the Progress in Theoretical Computer Science book series (PTCS)

Abstract

This chapter introduces higher-order unification and term rewriting. First, Section 4.1 reviews a set of transformation rules for full higher-order pre-unification. This is followed by an important special case, higher-order patterns, where unification proceeds almost as in the first-order case.

Keywords

Lution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Christian Prehofer
    • 1
  1. 1.Institut für Informatik, SB3MünchenGermany

Personalised recommendations