| On full abstraction for PCF: I, II, and III JME Hyland, CHL Ong Information and computation 163 (2), 285-408, 2000 | 812 | 2000 |
| Full abstraction in the lazy lambda calculus S Abramsky, CHL Ong Inf. Comput. 105 (2), 159-267, 1993 | 320 | 1993 |
| On model-checking trees generated by higher-order recursion schemes CHL Ong 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 81-90, 2006 | 269 | 2006 |
| A Curry-Howard foundation for functional computation with control CHL Ong, CA Stewart Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of …, 1997 | 186 | 1997 |
| Route oscillations in I-BGP with route reflection A Basu, CHL Ong, A Rasala, FB Shepherd, G Wilfong ACM SIGCOMM Computer Communication Review 32 (4), 235-247, 2002 | 161 | 2002 |
| A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes N Kobayashi, CHL Ong 2009 24th Annual IEEE Symposium on Logic In Computer Science, 179-188, 2009 | 148 | 2009 |
| Collapsible pushdown automata and recursion schemes M Hague, AS Murawski, CHL Ong, O Serre 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 452-461, 2008 | 142 | 2008 |
| Verifying higher-order functional programs with pattern-matching algebraic data types CHL Ong, SJ Ramsay Proceedings ACM POPL SIGPLAN Notices 46 (1), 587-598, 2011 | 117 | 2011 |
| Verifying Higher-Order Functional Programs with Pattern Matching Algebraic Data Types CHL Ong, S Ramsay | 117 | 2011 |
| The lazy lambda calculus: an investigation into the foundations of functional programming CHL Ong Imperial College London, 1992 | 102 | 1992 |
| A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations CHL Ong Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 230-241, 1996 | 92 | 1996 |
| Applying game semantics to compositional software modeling and verification S Abramsky, DR Ghica, AS Murawski, CHL Ong International Conference on Tools and Algorithms for the Construction and …, 2004 | 90 | 2004 |
| Non-determinism in a functional setting CHL Ong [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993 | 87 | 1993 |
| Nominal games and full abstraction for the nu-calculus S Abramsky, DR Ghica, AS Murawski, CHL Ong, IDB Stark Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 84 | 2004 |
| Pi-calculus, dialogue games and full abstraction PCF JME Hyland, CHL Ong Proceedings of the seventh international conference on Functional …, 1995 | 76 | 1995 |
| Fair games and full completeness for multiplicative linear logic without the mix-rule JME Hyland, CHL Ong preprint 190, 1993 | 75 | 1993 |
| Correspondence between operational and denotational semantics: the full abstraction problem for PCF CHL Ong Handbook of logic in computer science 4, 269-356, 1995 | 69 | 1995 |
| Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network A Basu, CHL Ong, AP Rasala, FB Sheperd, GT Wilfong US Patent 7,180,864, 2007 | 67 | 2007 |
| Recursion schemes and logical reflection CH Broadbent, A Carayol, CHL Ong, O Serre 2010 25th Annual IEEE Symposium on Logic in Computer Science, 120-129, 2010 | 60 | 2010 |
| Automatic verification of Erlang-style concurrency E D’Osualdo, J Kochems, CHL Ong International Static Analysis Symposium, 454-476, 2013 | 58 | 2013 |
