Positive and negative results for higher-order disunification - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1995

Positive and negative results for higher-order disunification

Résumé

This paper is devoted to higher-order disunification which is the process of solving quantified formulae built on simply-typed lambda-terms, the equality induced by the $\eta$ and the $\beta$ reductions, boolean connectives and the negation. This problem is motivated by tests of completeness of definitions in algebraic higher-order specification languages which combine the advantages of algebraic specification languages and higher-order programming languages. We show that higher-order disunification is not semi-decidable and we prove the undecidability of second-order complement problems which are the formulae expressing the completeness of some scheme, by encoding Minsky machines. On the other hand, we show that second-order complement problems are decidable if second-order variables and bound variables satisfy some (reasonable) conditions and that the validity of any quantified equational formula can be checked when all the terms occurring in this formula are patterns, i.e. s.t. the arguments of free variables are distinct bound variables. Both cases are decided using quantifier elimination techniques.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-2492.pdf (1.58 Mo) Télécharger le fichier

Dates et versions

inria-00074183 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00074183 , version 1

Citer

Denis Lugiez. Positive and negative results for higher-order disunification. [Research Report] RR-2492, INRIA. 1995, pp.36. ⟨inria-00074183⟩
53 Consultations
84 Téléchargements

Partager

Gmail Facebook X LinkedIn More