@inproceedings(word2tree, author = {Kazuyuki Asada and Naoki Kobayashi}, year = {2016}, title = {On Word and Frontier Languages of Unsafe Higher-Order Grammars}, editor = {Chatzigiannakis}, pages = {111:1--111:13}, doi = {10.4230/LIPIcs.ICALP.2016.111}, ) @inproceedings(koba-pumping-new, author = {Kazuyuki Asada and Naoki Kobayashi}, year = {2017}, title = {Pumping Lemma for Higher-order Languages}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {97:1--97:14}, doi = {10.4230/LIPIcs.ICALP.2017.97}, ) @inproceedings(quasi-weak, author = {Achim Blumensath and Thomas Colcombet and Denis Kuperberg and Pawe\IeC{\l} Parys and {Vanden Boom}, Michael}, year = {2014}, title = {Two-Way Cost Automata and Cost Logics over Infinite Trees}, editor = {Thomas A. Henzinger and Dale Miller}, booktitle = {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}, publisher = {{ACM}}, pages = {16:1--16:9}, doi = {10.1145/2603088.2603104}, ) @inproceedings(saturation, author = {Christopher H. Broadbent and Arnaud Carayol and Matthew Hague and Olivier Serre}, year = {2012}, title = {A Saturation Method for Collapsible Pushdown Systems}, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, booktitle = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7392}, publisher = {Springer}, pages = {165--176}, doi = {10.1007/978-3-642-31585-5\_18}, ) @inproceedings(DBLP:conf/csl/BroadbentK13, author = {Christopher H. Broadbent and Naoki Kobayashi}, year = {2013}, title = {Saturation-Based Model Checking of Higher-Order Recursion Schemes}, editor = {Simona Ronchi Della Rocca}, booktitle = {Computer Science Logic 2013 {(CSL} 2013), {CSL} 2013, September 2-5, 2013, Torino, Italy}, series = {LIPIcs}, volume = {23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {129--148}, doi = {10.4230/LIPIcs.CSL.2013.129}, ) @proceedings(DBLP:conf/icalp/2016, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, year = {2016}, title = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, ) @inproceedings(DBLP:conf/fsttcs/ClementePSW15, author = {Lorenzo Clemente and Pawe\IeC{\l} Parys and Sylvain Salvati and Igor Walukiewicz}, year = {2015}, title = {Ordered Tree-Pushdown Systems}, editor = {Prahladh Harsha and G. Ramalingam}, booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015, Bangalore, India}, series = {LIPIcs}, volume = {45}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {163--177}, doi = {10.4230/LIPIcs.FSTTCS.2015.163}, ) @inproceedings(downward-closure, author = {Lorenzo Clemente and Pawe\IeC{\l} Parys and Sylvain Salvati and Igor Walukiewicz}, year = {2016}, title = {The Diagonal Problem for Higher-Order Recursion Schemes is Decidable}, editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar}, booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016}, publisher = {{ACM}}, pages = {96--105}, doi = {10.1145/2933575.2934527}, ) @article(regular-cost-functions, author = {Thomas Colcombet}, year = {2013}, title = {Regular Cost Functions, Part {I:} Logic and Algebra over Words}, journal = {Logical Methods in Computer Science}, volume = {9}, number = {3}, doi = {10.2168/LMCS-9(3:3)2013}, ) @inproceedings(Czerwinski-piecewise, author = {Czerwi\IeC{\'n}ski, Wojciech and Wim Martens and Lorijn van Rooijen and Marc Zeitoun}, year = {2015}, title = {A Note on Decidable Separability by Piecewise Testable Languages}, editor = {Adrian Kosowski and Igor Walukiewicz}, booktitle = {Fundamentals of Computation Theory - 20th International Symposium, {FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9210}, publisher = {Springer}, pages = {173--185}, doi = {10.1007/978-3-319-22177-9\_14}, ) @article(Damm82, author = {Werner Damm}, year = {1982}, title = {The {IO-} and {OI}-Hierarchies}, journal = {Theor. Comput. Sci.}, volume = {20}, pages = {95--207}, doi = {10.1016/0304-3975(82)90009-3}, ) @inproceedings(schmitz-kruskal, author = {Goubault{-}Larrecq, Jean and Sylvain Schmitz}, year = {2016}, title = {Deciding Piecewise Testable Separability for Regular Tree Languages}, editor = {Chatzigiannakis}, pages = {97:1--97:15}, doi = {10.4230/LIPIcs.ICALP.2016.97}, ) @inproceedings(linear-logic-2, author = {Charles Grellois and Paul{-}Andr{\'{e}} Melli{\`{e}}s}, year = {2015}, title = {Finitary Semantics of Linear Logic and Higher-Order Model-Checking}, editor = {Giuseppe F. Italiano and Giovanni Pighizzini and Donald Sannella}, booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9234}, publisher = {Springer}, pages = {256--268}, doi = {10.1007/978-3-662-48057-1\_20}, ) @inproceedings(linear-logic-1, author = {Charles Grellois and Paul{-}Andr{\'{e}} Melli{\`{e}}s}, year = {2015}, title = {Relational Semantics of Linear Logic and Higher-order Model Checking}, editor = {Stephan Kreutzer}, booktitle = {24th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2015, September 7-10, 2015, Berlin, Germany}, series = {LIPIcs}, volume = {41}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {260--276}, doi = {10.4230/LIPIcs.CSL.2015.260}, ) @inproceedings(collapsible, author = {Matthew Hague and Andrzej S. Murawski and C.{-}H. Luke Ong and Olivier Serre}, year = {2008}, title = {Collapsible Pushdown Automata and Recursion Schemes}, booktitle = {Proceedings of the Twenty-Third Annual {IEEE} Symposium on Logic in Computer Science, {LICS} 2008, 24-27 June 2008, Pittsburgh, PA, {USA}}, publisher = {{IEEE} Computer Society}, pages = {452--461}, doi = {10.1109/LICS.2008.34}, ) @inproceedings(Kar-Par-pumping, author = {Alexander Kartzow and Pawe\IeC{\l} Parys}, year = {2012}, title = {Strictness of the Collapsible Pushdown Hierarchy}, editor = {Branislav Rovan and Vladimiro Sassone and Peter Widmayer}, booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7464}, publisher = {Springer}, pages = {566--577}, doi = {10.1007/978-3-642-32589-2\_50}, ) @inproceedings(KNU-hopda, author = {Teodor Knapik and Niwi\IeC{\'n}ski, Damian and Pawe\IeC{\l} Urzyczyn}, year = {2002}, title = {Higher-Order Pushdown Trees Are Easy}, editor = {Mogens Nielsen and Uffe Engberg}, booktitle = {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}, series = {Lecture Notes in Computer Science}, volume = {2303}, publisher = {Springer}, pages = {205--222}, doi = {10.1007/3-540-45931-6\_15}, ) @article(Kobayashi-types, author = {Naoki Kobayashi}, year = {2013}, title = {Model Checking Higher-Order Programs}, journal = {J. {ACM}}, volume = {60}, number = {3}, pages = {20:1--20:62}, doi = {10.1145/2487241.2487246}, ) @inproceedings(koba-pumping, author = {Naoki Kobayashi}, year = {2013}, title = {Pumping by Typing}, booktitle = {28th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2013, New Orleans, LA, USA, June 25-28, 2013}, publisher = {{IEEE} Computer Society}, pages = {398--407}, doi = {10.1109/LICS.2013.46}, ) @inproceedings(context-sensitive-2, author = {Naoki Kobayashi and Kazuhiro Inaba and Takeshi Tsukada}, year = {2014}, title = {Unsafe Order-2 Tree Languages Are Context-Sensitive}, editor = {Anca Muscholl}, booktitle = {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}, series = {Lecture Notes in Computer Science}, volume = {8412}, publisher = {Springer}, pages = {149--163}, doi = {10.1007/978-3-642-54830-7\_10}, ) @inproceedings(kobayashiOng2009type, author = {Naoki Kobayashi and C.{-}H. Luke Ong}, year = {2009}, title = {A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes}, booktitle = {Proceedings of the 24th Annual {IEEE} Symposium on Logic in Computer Science, {LICS} 2009, 11-14 August 2009, Los Angeles, CA, {USA}}, publisher = {{IEEE} Computer Society}, pages = {179--188}, doi = {10.1109/LICS.2009.29}, ) @inproceedings(Ong-hoschemes, author = {C.{-}H. Luke Ong}, year = {2006}, title = {On Model-Checking Trees Generated by Higher-Order Recursion Schemes}, booktitle = {21th {IEEE} Symposium on Logic in Computer Science {(LICS} 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings}, publisher = {{IEEE} Computer Society}, pages = {81--90}, doi = {10.1109/LICS.2006.38}, ) @inproceedings(ho-new, author = {Pawe\IeC{\l} Parys}, year = {2012}, title = {On the Significance of the Collapse Operation}, booktitle = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012}, publisher = {{IEEE} Computer Society}, pages = {521--530}, doi = {10.1109/LICS.2012.62}, ) @article(numbers-journal, author = {Pawe\IeC{\l} Parys}, year = {2016}, title = {A Characterization of Lambda-terms Transforming Numerals}, journal = {J. Funct. Program.}, volume = {26}, pages = {e12}, doi = {10.1017/S0956796816000113}, ) @inproceedings(itrs, author = {Pawe\IeC{\l} Parys}, year = {2016}, title = {Intersection Types and Counting}, editor = {Naoki Kobayashi}, booktitle = {Proceedings Eighth Workshop on Intersection Types and Related Systems, {ITRS} 2016, Porto, Portugal, 26th June 2016.}, series = {{EPTCS}}, volume = {242}, pages = {48--63}, doi = {10.4204/EPTCS.242.6}, ) @inproceedings(diagonal-types, author = {Pawe\IeC{\l} Parys}, year = {2017}, title = {The Complexity of the Diagonal Problem for Recursion Schemes}, editor = {Satya V. Lokam and R. Ramanujam}, booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017, Kanpur, India}, series = {LIPIcs}, volume = {93}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {45:1--45:14}, doi = {10.4230/LIPIcs.FSTTCS.2017.45}, ) @inproceedings(homogeneity, author = {Pawe\IeC{\l} Parys}, year = {2018}, title = {Homogeneity Without Loss of Generality}, editor = {H{\'{e}}l{\`{e}}ne Kirchner}, booktitle = {3rd International Conference on Formal Structures for Computation and Deduction, {FSCD} 2018, July 9-12, 2018, Oxford, {UK}}, series = {LIPIcs}, volume = {108}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {27:1--27:15}, doi = {10.4230/LIPIcs.FSCD.2018.27}, ) @inproceedings(wmsou-schemes, author = {Pawe\IeC{\l} Parys}, year = {2018}, title = {Recursion Schemes and the {WMSO+U} Logic}, editor = {Rolf Niedermeier and Brigitte Vall{\'{e}}e}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS} 2018, February 28 to March 3, 2018, Caen, France}, series = {LIPIcs}, volume = {96}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, pages = {53:1--53:16}, doi = {10.4230/LIPIcs.STACS.2018.53}, ) @inproceedings(DBLP:conf/popl/RamsayNO14, author = {Steven J. Ramsay and Robin P. Neatherway and C.{-}H. Luke Ong}, year = {2014}, title = {A Type-Directed Abstraction Refinement Approach to Higher-Order Model Checking}, editor = {Suresh Jagannathan and Peter Sewell}, booktitle = {The 41st Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} '14, San Diego, CA, USA, January 20-21, 2014}, publisher = {{ACM}}, pages = {61--72}, doi = {10.1145/2535838.2535873}, ) @inproceedings(Zetzsche-down-clo, author = {Georg Zetzsche}, year = {2015}, title = {An Approach to Computing Downward Closures}, editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann}, booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {9135}, publisher = {Springer}, pages = {440--451}, doi = {10.1007/978-3-662-47666-6\_35}, )