References

  1. Kazuyuki Asada & Naoki Kobayashi (2016): On Word and Frontier Languages of Unsafe Higher-Order Grammars. In: Chatzigiannakis, pp. 111:1–111:13, doi:10.4230/LIPIcs.ICALP.2016.111.
  2. Kazuyuki Asada & Naoki Kobayashi (2017): Pumping Lemma for Higher-order Languages. In: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn & Anca Muscholl: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, LIPIcs 80. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 97:1–97:14, doi:10.4230/LIPIcs.ICALP.2017.97.
  3. Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawe\IeCł Parys & Michael Vanden Boom (2014): Two-Way Cost Automata and Cost Logics over Infinite Trees. In: Thomas A. Henzinger & Dale Miller: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014. ACM, pp. 16:1–16:9, doi:10.1145/2603088.2603104.
  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. Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani & Davide Sangiorgi (2016): 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. LIPIcs 55. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
  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. Lorenzo Clemente, Pawe\IeCł 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.
  9. Thomas Colcombet (2013): Regular Cost Functions, Part I: Logic and Algebra over Words. Logical Methods in Computer Science 9(3), doi:10.2168/LMCS-9(3:3)2013.
  10. Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen & Marc Zeitoun (2015): A Note on Decidable Separability by Piecewise Testable Languages. In: Adrian Kosowski & Igor Walukiewicz: Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, Lecture Notes in Computer Science 9210. Springer, pp. 173–185, doi:10.1007/978-3-319-22177-9_14.
  11. Werner Damm (1982): The IO- and OI-Hierarchies. Theor. Comput. Sci. 20, pp. 95–207, doi:10.1016/0304-3975(82)90009-3.
  12. Jean Goubault-Larrecq & Sylvain Schmitz (2016): Deciding Piecewise Testable Separability for Regular Tree Languages. In: Chatzigiannakis, pp. 97:1–97:15, doi:10.4230/LIPIcs.ICALP.2016.97.
  13. Charles Grellois & Paul-André Melliès (2015): Finitary Semantics of Linear Logic and Higher-Order Model-Checking. In: Giuseppe F. Italiano, Giovanni Pighizzini & Donald Sannella: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I, Lecture Notes in Computer Science 9234. Springer, pp. 256–268, doi:10.1007/978-3-662-48057-1_20.
  14. Charles Grellois & Paul-André Melliès (2015): Relational Semantics of Linear Logic and Higher-order Model Checking. In: Stephan Kreutzer: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, LIPIcs 41. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 260–276, doi:10.4230/LIPIcs.CSL.2015.260.
  15. 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.
  16. 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.
  17. 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.
  18. Naoki Kobayashi (2013): Model Checking Higher-Order Programs. J. ACM 60(3), pp. 20:1–20:62, doi:10.1145/2487241.2487246.
  19. 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.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. Pawe\IeCł Parys (2016): A Characterization of Lambda-terms Transforming Numerals. J. Funct. Program. 26, pp. e12, doi:10.1017/S0956796816000113.
  25. Pawe\IeCł Parys (2016): Intersection Types and Counting. In: Naoki Kobayashi: Proceedings Eighth Workshop on Intersection Types and Related Systems, ITRS 2016, Porto, Portugal, 26th June 2016., EPTCS 242, pp. 48–63, doi:10.4204/EPTCS.242.6.
  26. Pawe\IeCł Parys (2017): The Complexity of the Diagonal Problem for Recursion Schemes. In: Satya V. Lokam & R. Ramanujam: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, LIPIcs 93. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 45:1–45:14, doi:10.4230/LIPIcs.FSTTCS.2017.45.
  27. Pawe\IeCł Parys (2018): Homogeneity Without Loss of Generality. In: Hélène Kirchner: 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK, LIPIcs 108. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 27:1–27:15, doi:10.4230/LIPIcs.FSCD.2018.27.
  28. Pawe\IeCł Parys (2018): Recursion Schemes and the WMSO+U Logic. In: Rolf Niedermeier & Brigitte Vallée: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, LIPIcs 96. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 53:1–53:16, doi:10.4230/LIPIcs.STACS.2018.53.
  29. 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.
  30. Georg Zetzsche (2015): An Approach to Computing Downward Closures. In: Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi & Bettina Speckmann: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, Lecture Notes in Computer Science 9135. Springer, pp. 440–451, doi:10.1007/978-3-662-47666-6_35.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org