Higher-Order Pushdown Trees Are Easy

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn. Higher-Order Pushdown Trees Are Easy. In Mogens Nielsen, Uffe Engberg, editors, Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings. Volume 2303 of Lecture Notes in Computer Science, pages 205-222, Springer, 2002. [doi]

Abstract

Abstract is missing.