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

Gilles Dowek 1 Thérèse Hardin Claude Kirchner 2 Frank Pfenning
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00077203
Contributor : Rapport de Recherche Inria <>
Submitted on : Monday, May 29, 2006 - 5:19:30 PM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Monday, April 5, 2010 - 9:44:50 PM

Identifiers

  • HAL Id : inria-00077203, version 1

Citation

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⟩

Share

Metrics

Record views

233

Files downloads

200