Sharing Equality is Linear - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Sharing Equality is Linear

Résumé

The λ-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the number of β-steps. This is why implementations of functional languages and proof assistants always rely on some form of sharing of subterms. These frameworks however do not only evaluate λ-terms, they also have to compare them for equality. In presence of sharing, one is actually interested in equality of the underlying unshared λ-terms. The literature contains algorithms for such a sharing equality, that are polynomial in the sizes of the shared terms. This paper improves the bounds in the literature by presenting the first linear time algorithm. As others before us, we are inspired by Paterson and Wegman's algorithm for first-order unification, itself based on representing terms with sharing as DAGs, and sharing equality as bisimulation of DAGs. Beyond the improved complexity, a distinguishing point of our work is a dissection of the involved concepts. In particular, we show that the algorithm computes the smallest bisimulation between the given DAGs, if any.
Fichier principal
Vignette du fichier
a9-Condoluci.pdf (791.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02415769 , version 1 (17-12-2019)

Identifiants

Citer

Andrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen. Sharing Equality is Linear. PPDP 2019 - 21st International Symposium on Principles and Practice of Programming Languages, Oct 2019, Porto, Portugal. ⟨10.1145/3354166.3354174⟩. ⟨hal-02415769⟩
55 Consultations
89 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More