Second-order unification and functional arity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Second-order unification and functional arity

Abstract

We consider expressions that represent functional types where the main binary symbol is → and arbitrarily many constants are available. There are natural notions of rank and arity for such expressions that arise in the study of functional programs. We present an argument for undecidability of second-order unification in case solutions are restricted to expressions that have bounded rank, but unbounded arity.
Fichier principal
Vignette du fichier
UNIF_2023_paper_2.pdf (527.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-04128012 , version 1 (14-06-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04128012 , version 1

Cite

Aleksy Schubert. Second-order unification and functional arity. 37th International Workshop on Unification (UNIF 2023), Veena Ravishankar; Christophe Ringeissen, Jul 2023, Rome, Italy. ⟨hal-04128012⟩

Collections

UNIF2023
28 View
9 Download

Share

Gmail Facebook X LinkedIn More