Quantitative semantics of the lambda calculus: Some generalisations of the relational model by Ong, C

Automata, logic and games for the λ-calculus by Ong, C

Full Abstraction in the Lazy λ−calculus by Abramsky, S, Ong, C

Verifying Higher−Order Functional Programs with Pattern Matching Algebraic Data Types by Ong, C, Ramsay, S

Plays as resource terms via non-idempotent intersection types by Tsukada, T, Ong, C

Verifying higher-order functional programs with pattern-matching algebraic data types by Ong, C, Ramsay, S

On an interpretation of safe recursion in light affine logic by Murawski, A, Ong, C

The Safe Lambda Calculus by Blum, W, Ong, C

Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars by Kochems, J, Ong, C

Simulating cardinal preferences in Boolean games: A proof technique by Ianovski, E, Ong, C

Winning Regions of Pushdown Parity Games: A Saturation Method by Hague, M, Ong, C

The complexity of decision problems about equilibria in two-player Boolean games by Ianovski, E, Ong, C

Symbolic Backwards Reachability Analysis for Higher−Order Pushdown Systems by Hague, M, Ong, C

On full abstraction for PCF: I, II, and III by Hyland, J, Ong, C

A saturation method for the modal mu-calculus over pushdown systems by Hague, M, Ong, C

Exhausting strategies, joker games and full completeness for IMLL with Unit by Murawski, A, Ong, C

A type system equivalent to the modal Mu-calculus model checking of higher-order recursion schemes by Kobayashi, N, Ong, C

A Saturation Method for the Modal Mu−Calculus over Pushdown Systems by Hague, M, Ong, C

Symbolic Backwards−Reachability Analysis for Higher−Order Pushdown Systems by Hague, M, Ong, C

On Global Model Checking Trees Generated by Higher−Order Recursion Schemes by Broadbent, C, Ong, C