Unification via Explicit Substitutions: The Case of Higher-Order Patterns

Gilles Dowek (1) , Thérèse Hardin , Claude Kirchner (2) , Frank Pfenning

1 INRIA Rocquencourt
2 PROTHEO - Constraints, automatic deduction and software properties proofs

In [6] we have proposed a general higher-order unification method using a theory of explicit substitutions and we have proved its completeness. In this paper, we investigate the case of higher-order patterns as introduced by Miller. We show that our general algorithm specializes in a very convenient way to patterns. We also sketch an efficient implementation of the abstract algorithm and its generalization to constraint simplification, which has yielded good experimental results at the core of a higher-order constraint logic programming language.

Mots clés: explicit substitutions; higher order unification; pattern unification; constraint simplification; higher-order logic programming

Domaines: Autre [cs.OH]

Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning. Unification via Explicit Substitutions: The Case of Higher-Order Patterns. [Research Report] RR-3591, INRIA. 1998, pp.33. ⟨inria-00077203⟩