Unification via Explicit Substitutions: The Case of Higher-Order Patterns - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1998

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

(1) , , (2) ,
1
2
Gilles Dowek
  • Function : Author
Thérèse Hardin
  • Function : Author
Frank Pfenning
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-3591.pdf (448.72 Ko) Télécharger le fichier

Dates and versions

inria-00077203 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077203 , version 1

Cite

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⟩
126 View
131 Download

Share

Gmail Facebook Twitter LinkedIn More