Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type

  • Roland Fettig
  • Bernd Löchner
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1103)

Abstract

We develop a higher-order unification algorithm for a restricted class of simply typed lambda terms with function space and product type constructors. It is based on an inference system manipulating so called higher-order product-patterns which is proven to be sound and complete. Allowing tuple constructors in lambda binders provides elegant notations. We show that our algorithm terminates on each input and produces a most general unifier if one exists. The approach also extends smoothly to a calculus with terminal type.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Roland Fettig
    • 1
  • Bernd Löchner
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserslauternKaiserslauternGermany

Personalised recommendations