Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection

Higher-order recursion schemes are rewriting systems for simply typed terms and they are known to be equi-expressive with collapsible pushdown automata (CPDA) for generating trees. We argue that CPDA are an essential model when working with recursion schemes. First, we give a new proof of the translation of schemes into CPDA that does not appeal to game semantics. Second, we show that this translation permits to revisit the safety constraint and allows CPDA to be seen as Krivine machines. Finally, we show that CPDA permit one to prove the effective MSO selection property for schemes, subsuming all known decidability results for MSO on schemes.

[1]  Christof Löding,et al.  Choice functions and well-orderings over the infinite binary tree , 2010 .

[2]  Bruno Courcelle,et al.  A Representation of Trees by Languages I , 1978, Theor. Comput. Sci..

[3]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

[4]  Christopher H. Broadbent.  On collapsible pushdown automata, their graphs and the power of links , 2011 .

[5]  Pawel Urzyczyn,et al.  Deciding Monadic Theories of Hyperalgebraic Trees , 2001, TLCA.

[6]  Alexander Moshe Rabinovich,et al.  Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey , 2008, Pillars of Computer Science.

[7]  Jean-Louis Krivine,et al.  A call-by-name lambda-calculus machine , 2007, High. Order Symb. Comput..

[8]  Werner Damm,et al.  The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..

[9]  Igor Walukiewicz,et al.  The Complexity of Games on Higher Order Pushdown Automata , 2007, ArXiv.

[10]  C.-H. Luke Ong,et al.  Recursion Schemes and Logical Reflection , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[11]  W. Browder,et al.  Annals of Mathematics , 1889 .

[12]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[13]  Pawel Parys.  On the Significance of the Collapse Operation , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[14]  Bruno Courcelle,et al.  A Representation of Trees by Languages II , 1978, Theor. Comput. Sci..

[15]  Igor Walukiewicz,et al.  Krivine machines and higher-order schemes , 2011, Inf. Comput..

[16]  Andrzej S. Murawski,et al.  Collapsible Pushdown Automata and Recursion Schemes , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[17]  C.-H. Luke Ong,et al.  A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[18]  Igor Walukiewicz,et al.  Unsafe Grammars and Panic Automata , 2005, ICALP.

[19]  Arnaud Carayol,et al.  Positional Strategies for Higher-Order Pushdown Parity Games , 2008, MFCS.

[20]  Arnaud Carayol.  Automates infinis, logiques et langages , 2006 .

[21]  Jolie G. de Miranda.  Structures generated by higher-order grammars and the safety constraint , 2006 .