Date: 02 Jun 2005

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

* Final gross prices may vary according to local VAT.

Get Access

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.