References

  1. Achim Blumensath (2008): On the Structure of Graphs in the Caucal Hierarchy. Theor. Comput. Sci. 400(1-3), pp. 19–45, doi:10.1016/j.tcs.2008.01.053.
  2. Achim Blumensath (2013): Erratum to "On the Structure of Graphs in the Caucal Hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45]. Theor. Comput. Sci. 475, pp. 126–127, doi:10.1016/j.tcs.2012.12.044.
  3. Mikołaj Bojańczyk & Szymon Toruńczyk (2012): Weak MSO+U over Infinite Trees. In: Christoph Dürr & Thomas Wilke: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, LIPIcs 14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 648–660, doi:10.4230/LIPIcs.STACS.2012.648.
  4. Christopher H. Broadbent, Arnaud Carayol, Matthew Hague & Olivier Serre (2012): A Saturation Method for Collapsible Pushdown Systems. In: Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts & Roger Wattenhofer: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, Lecture Notes in Computer Science 7392. Springer, pp. 165–176, doi:10.1007/978-3-642-31585-5_18.
  5. Christopher H. Broadbent & Naoki Kobayashi (2013): Saturation-Based Model Checking of Higher-Order Recursion Schemes. In: Simona Ronchi Della Rocca: Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy, LIPIcs 23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 129–148, doi:10.4230/LIPIcs.CSL.2013.129.
  6. Lorenzo Clemente, Pawel Parys, Sylvain Salvati & Igor Walukiewicz (2016): The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. In: Martin Grohe, Eric Koskinen & Natarajan Shankar: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. ACM, pp. 96–105, doi:10.1145/2933575.2934527.
  7. Lorenzo Clemente, Pawe\IeCł Parys, Sylvain Salvati & Igor Walukiewicz (2015): Ordered Tree-Pushdown Systems. In: Prahladh Harsha & G. Ramalingam: 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India, LIPIcs 45. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 163–177, doi:10.4230/LIPIcs.FSTTCS.2015.163.
  8. Werner Damm (1982): The IO- and OI-Hierarchies. Theor. Comput. Sci. 20, pp. 95–207, doi:10.1016/0304-3975(82)90009-3.
  9. Matthew Hague, Jonathan Kochems & C.-H. Luke Ong (2016): Unboundedness and Downward Closures of Higher-Order Pushdown Automata. In: Rastislav Bodík & Rupak Majumdar: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016. ACM, pp. 151–163, doi:10.1145/2837614.2837627.
  10. Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong & Olivier Serre (2008): Collapsible Pushdown Automata and Recursion Schemes. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA. IEEE Computer Society, pp. 452–461, doi:10.1109/LICS.2008.34.
  11. Alexander Kartzow & Pawe\IeCł Parys (2012): Strictness of the Collapsible Pushdown Hierarchy. In: Branislav Rovan, Vladimiro Sassone & Peter Widmayer: Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, Lecture Notes in Computer Science 7464. Springer, pp. 566–577, doi:10.1007/978-3-642-32589-2_50.
  12. Teodor Knapik, Damian Niwiński & Pawe\IeCł Urzyczyn (2002): Higher-Order Pushdown Trees Are Easy. In: Mogens Nielsen & Uffe Engberg: 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, Lecture Notes in Computer Science 2303. Springer, pp. 205–222, doi:10.1007/3-540-45931-6_15.
  13. Naoki Kobayashi (2009): Types and Higher-Order Recursion Schemes for Verification of Higher-Order Programs. In: Zhong Shao & Benjamin C. Pierce: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009. ACM, pp. 416–428, doi:10.1145/1480881.1480933.
  14. Naoki Kobayashi (2013): Pumping by Typing. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013. IEEE Computer Society, pp. 398–407, doi:10.1109/LICS.2013.46.
  15. Naoki Kobayashi, Kazuhiro Inaba & Takeshi Tsukada (2014): Unsafe Order-2 Tree Languages Are Context-Sensitive. In: Anca Muscholl: Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, Lecture Notes in Computer Science 8412. Springer, pp. 149–163, doi:10.1007/978-3-642-54830-7_10.
  16. Naoki Kobayashi & C.-H. Luke Ong (2009): A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. IEEE Computer Society, pp. 179–188, doi:10.1109/LICS.2009.29.
  17. C.-H. Luke Ong (2006): On Model-Checking Trees Generated by Higher-Order Recursion Schemes. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. IEEE Computer Society, pp. 81–90, doi:10.1109/LICS.2006.38.
  18. Pawel Parys (2016): A Characterization of Lambda-Terms Transforming Numerals. J. Funct. Program. 26, pp. e12, doi:10.1017/S0956796816000113.
  19. Pawe\IeCł Parys (2012): On the Significance of the Collapse Operation. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012. IEEE Computer Society, pp. 521–530, doi:10.1109/LICS.2012.62.
  20. Pawe\IeCł Parys (2017): Intersection Types and Counting. CoRR abs/1701.05303v1. Available at http://arxiv.org/abs/1701.05303v1.
  21. Steven J. Ramsay, Robin P. Neatherway & C.-H. Luke Ong (2014): A Type-Directed Abstraction Refinement Approach to Higher-Order Model Checking. In: Suresh Jagannathan & Peter Sewell: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014. ACM, pp. 61–72, doi:10.1145/2535838.2535873.
  22. Sylvain Salvati & Igor Walukiewicz (2016): Simply Typed Fixpoint Calculus and Collapsible Pushdown Automata. Mathematical Structures in Computer Science 26(7), pp. 1304–1350, doi:10.1017/S0960129514000590.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org