Linearity in higher-order recursion schemes

Pierre Clairambault 1, 2 Charles Grellois 3, 4 Andrzej Murawski 5
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
4 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : Higher-order recursion schemes (HORS) have recently emerged as a promising foundation for higher-order program verification. We examine the impact of enriching HORS with linear types. To that end, we introduce two frameworks that blend non-linear and linear types: a variant of the λY -calculus and an extension of HORS, called linear HORS (LHORS). First we prove that the two formalisms are equivalent and there exist polynomial-time translations between them. Then, in order to support model-checking of (trees generated by) LHORS, we propose a refined version of alternating parity tree automata, called LNAPTA, whose behaviour depends on information about linearity. We show that the complexity of LNAPTA model-checking for LHORS depends on two type-theoretic parameters: linear order and linear depth. The former is in general smaller than the standard notion of order and ignores linear function spaces. In contrast, the latter measures the depth of linear clusters inside a type. Our main result states that LNAPTA model-checking of LHORS of linear order n is n-EXPTIME-complete, when linear depth is fixed. This generalizes and improves upon the classic result of Ong, which relies on the standard notion of order. To illustrate the significance of the result, we consider two applications: the MSO model-checking problem on variants of HORS with case distinction (RSFD and HORSC) on a finite domain and a call-by-value resource verification problem. In both cases, decidability can be established by translation into HORS, but the implied complexity bounds will be suboptimal due to increases in type order. In contrast, we show that the complexity bounds derived by translations into LHORS and appealing to our result are optimal in that they match the respective hardness results.
Type de document :
Article dans une revue
Proceedings of the ACM on Programming Languages, ACM, 2017, 2 (POPL), pp.1 - 29. 〈10.1145/3158127〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01886931
Contributeur : Pierre Clairambault <>
Soumis le : mercredi 3 octobre 2018 - 13:40:07
Dernière modification le : samedi 6 octobre 2018 - 01:17:19

Lien texte intégral

Identifiants

Citation

Pierre Clairambault, Charles Grellois, Andrzej Murawski. Linearity in higher-order recursion schemes. Proceedings of the ACM on Programming Languages, ACM, 2017, 2 (POPL), pp.1 - 29. 〈10.1145/3158127〉. 〈hal-01886931〉

Partager

Métriques

Consultations de la notice

15