SKInT Labels
Résumé
SKIn and SKInT are first-order rewrite systems, i.e., calculi of explicit substitutions in a broad sense, that implement-reduction in the-calculus and are confluent even on open terms. SKInT additionally preserves strong and weak normalization, as well as existence of head normal forms. However it implements call-by-value more naturally than call-by-name. In this paper we investigate a notion of labellingà la Hyland-Wadsworth-Lévy for SKInT. Unsurprisingly, this allows us to reprove that SKInT is confluent. However, the structure of labels is surprisingly more complex than in the-calculus, and we try to explain why. Finally, we show that labeled SKInT reduction naturally implements a modified form of labeled reduction in the call-by-value-calculus that generalizes superdevelopmentsà la Aczel.
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)