Böhm trees as higher-order recursion schemes

Abstract : Higher-order recursive schemes (HORS) are schematic representations of functional programs. They generate possibly infinite ranked labelled trees and, in that respect, are known to be equivalent to a restricted fragment of the λY-calculus consisting of ground-type terms whose free variables have types of the form o → ⋯ → o (with o being a special case). In this paper, we show that any λY-term (with no restrictions on term type or the types of free variables) can actually be represented by a HORS. More precisely, for any λY-term M , there exists a HORS generating a tree that faithfully represents M 's (η-long) Böhm tree. In particular, the HORS captures higher-order binding information contained in the Böhm tree. An analogous result holds for finitary PCF. As a consequence, we can reduce a variety of problems related to the λY -calculus or finitary PCF to problems concerning higher-order recursive schemes. For instance, Böhm tree equivalence can be reduced to the equivalence problem for HORS. Our results also enable SO model-checking of Böhm trees, despite the general undecidability of the problem.
Type de document :
Communication dans un congrès
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), Dec 2013, Guwahati, India. pp.91--102, 2013, 〈10.4230/LIPIcs.FSTTCS.2013.91〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00966102
Contributeur : Pierre Clairambault <>
Soumis le : mercredi 26 mars 2014 - 10:40:13
Dernière modification le : jeudi 4 octobre 2018 - 01:15:41
Document(s) archivé(s) le : jeudi 26 juin 2014 - 10:56:39

Fichier

nbehors.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pierre Clairambault, Andrzej Murawski. Böhm trees as higher-order recursion schemes. Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), Dec 2013, Guwahati, India. pp.91--102, 2013, 〈10.4230/LIPIcs.FSTTCS.2013.91〉. 〈hal-00966102〉

Partager

Métriques

Consultations de la notice

269

Téléchargements de fichiers

120