Please note that the slides are not stable: they are being developed this week.
Part I, Part II, Parts III & IV.
C.-H. Luke Ong. Automata, Logic and Games. University of Oxford Lecture Notes. March 2013.
William Blum and C.-H. Luke Ong: The Safe Lambda Calculus. Logical Methods in Computer Science 5(1), 2009.
C.-H. Luke Ong. Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking. LATA 2013: 13-42. Springer LNCS 7810
C.-H. Luke Ong. On Model-Checking Trees Generated by Higher-Order Recursion Schemes. LICS 2006: 81-90. [Long version]
Naoki Kobayashi and C.-H. Luke Ong, Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. Logical Methods in Computer Science 7 (4), 2011.
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre: Recursion Schemes and Logical Reflection. LICS 2010: 120-129
C. Broadbent and C.-H. Luke Ong, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. FoSSaCS 2009:107-121, LNCS 5504
Naoki Kobayashi and C.-H. Luke Ong, A Type System Equivalent to Modal Mu-Calculus Model Checking of Recursion Schemes. LICS 2009: 179-188. [Long version]
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre: Collapsible Pushdown Automata and Recursion Schemes. LICS 2008: 452-461. [Long version]
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre: Winning Regions of Higher-Order Pushdown Games. LICS 2008: 193-204. [Long version]
C.-H. Luke Ong, Takeshi Tsukada: Two-Level Game Semantics, Intersection Types, and Recursion Schemes. ICALP (2) 2012: 325-336 [Long version]
Robin P. Neatherway, C.-H. Luke Ong, Steven James Ramsay: A Traversal-based Algorithm for Higher-Order Model Checking. ICFP 2012: 353-364
C.-H. Luke Ong, Steven James Ramsay: Verifying Higher-Order Functional Programs with Pattern-Matching Algebraic Data Types. POPL 2011: 587-598
To satisfy the conditions of certain publishers regarding distribution of my papers on the web, I have been advised to include the following:
The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit written permission of the copyright holder.