C.-H. Luke Ong

On Full Abstraction for PCF: I, II, and III

J. M. E. Hyland, C.-H. Luke Ong · Information and Computation · 2000 · 640 citations · Full text

Full Abstraction, Computational Complexity Theory, Abstract Interpretation +1

On Model-Checking Trees Generated by Higher-Order Recursion Schemes

C.-H. Luke Ong · 2006 · 260 citations

Tree Language, Programming Language Theory, Engineering +15

Full Abstraction in the Lazy Lambda Calculus

Samson Abramsky, C.-H. Luke Ong · Information and Computation · 1993 · 236 citations

Full Abstraction, Engineering, Automated Reasoning +4

A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes

Naoki Kobayashi, C.-H. Luke Ong · 2009 · 158 citations

Engineering, Automated Reasoning, Program Analysis +14

Collapsible Pushdown Automata and Recursion Schemes

Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong et al. · Proceedings - Symposium on Logic in Computer Science · 2008 · 147 citations

Tree Language, Engineering, Automated Reasoning +13