×
Compute Distance To:
Author ID: ong.chih-hao-luke Recent zbMATH articles by "Ong, Chih-Hao Luke"
Published as: Ong, C.-H. Luke; Ong, Chih-Hao Luke
Documents Indexed: 57 Publications since 1992
Co-Authors: 2 Co-Authors with 3 Joint Publications
2 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

48 Publications have been cited 34 times in 25 Documents Cited by Year
On full abstraction for PCF: I, II and III. Zbl 1006.68027
Hyland, J. M. E.; Ong, C.-H. L.
159
2000
Full abstraction in the lazy lambda calculus. Zbl 0779.03003
Abramsky, Samson; Ong, C.-H. Luke
65
1993
Verifying higher-order functional programs with pattern-matching algebraic data types. Zbl 1284.68193
Ong, C.-H. Luke; Ramsay, Steven James
17
2011
Collapsible pushdown automata and recursion schemes. Zbl 1407.68256
Hague, Matthew; Murawski, Andrzej S.; Ong, C.-H. Luke; Serre, Olivier
16
2017
A type-directed abstraction refinement approach to higher-order model checking. Zbl 1284.68414
Ramsay, Steven J.; Neatherway, Robin P.; Ong, C.-H. Luke
16
2014
Applying game semantics to compositional software modeling and verification. Zbl 1126.68343
Abramsky, Samson; Ghica, Dan R.; Murawski, Andrzej S.; Ong, C.-H. Luke
10
2004
Modified realizability toposes and strong normalization proofs. Zbl 0793.03079
Hyland, J. M. E.; Ong, C.-H. L.
10
1993
On an interpretation of safe recursion in light affine logic. Zbl 1048.03049
Murawski, A. S.; Ong, C.-H. L.
9
2004
Safety is not a restriction at level 2 for string languages. Zbl 1119.68102
Aehlig, K.; de Miranda, J. G.; Ong, C.-H. L.
7
2005
Idealized Algol with ground recursion, and DPDA equivalence. Zbl 1085.68092
Murawski, A. S.; Ong, C.-H. L.; Walukiewicz, I.
7
2005
Discreet games, light affine logic and PTIME computation. Zbl 0973.03038
Murawski, A. S.; Ong, C.-H. L.
7
2000
Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Zbl 1237.68124
Kobayashi, Naoki; Ong, C.-H. Luke
6
2011
A fragment of ML decidable by visibly pushdown automata. Zbl 1333.68079
Hopkins, David; Murawski, Andrzej S.; Ong, C.-H. Luke
6
2011
Typed meta-interpretive learning of logic programs. Zbl 07169107
Morel, Rolf; Cropper, Andrew; Ong, C.-H. Luke
6
2019
Unboundedness and downward closures of higher-order pushdown automata. Zbl 1347.68205
Hague, Matthew; Kochems, Jonathan; Ong, C.-H. Luke
5
2016
Improved functional flow and reachability analyses using indexed linear tree grammars. Zbl 1236.68134
Kochems, Jonathan; Ong, C. H. Luke
5
2011
Nondeterminism in game semantics via sheaves. Zbl 1401.68177
Tsukada, Takeshi; Ong, C. H. Luke
5
2015
Explicit substitution internal languages for autonomous and *-autonomous categories. Zbl 0967.03025
Koh, T. W.; Ong, C.-H. L.
5
1999
Fragments of ML decidable by nested data class memory automata. Zbl 1459.68035
Cotton-Barratt, Conrad; Hopkins, David; Murawski, Andrzej S.; Ong, C.-H. Luke
4
2015
Symbolic backwards-reachability analysis for higher-order pushdown systems. Zbl 1195.68057
Hague, Matthew; Ong, C.-H. Luke
4
2007
Syntactic control of concurrency. Zbl 1086.68087
Ghica, D. R.; Murawski, A. S.; Ong, C.-H. L.
4
2006
Syntactic control of concurrency. Zbl 1099.68656
Ghica, D. R.; Murawski, A. S.; Ong, C.-H. L.
3
2004
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. Zbl 1114.03006
Aehlig, Klaus; de Miranda, Jolie G.; Ong, C.-H. Luke
3
2005
A saturation method for the modal \(\mu \)-calculus over pushdown systems. Zbl 1215.68151
Hague, M.; Ong, C.-H. L.
3
2011
Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs. Zbl 1497.68128
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
3
2018
Fast verification of MLL proof nets via IMLL. Zbl 1367.03112
Murawski, Andrzej S.; Ong, C.-H. Luke
3
2006
Evolving games and essential nets for affine polymorphism. Zbl 0981.03064
Murawski, Andrzej S.; Ong, C.-H. Luke
3
2001
Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Zbl 1248.68334
Kobayashi, Naoki; Ong, C.-H. Luke
3
2009
Exhausting strategies, joker games and full completeness for IMLL with unit. Zbl 1029.03053
Murawski, A. S.; Ong, C.-H. L.
3
2003
Winning regions of pushdown parity games: a saturation method. Zbl 1254.68135
Hague, Matthew; Ong, C.-H. Luke
3
2009
Change actions: models of generalised differentiation. Zbl 07158690
Alvarez-Picallo, Mario; Ong, C.-H. Luke
3
2019
Densities of almost surely terminating probabilistic programs are differentiable almost everywhere. Zbl 1473.68048
Mak, Carol; Ong, C.-H. Luke; Paquet, Hugo; Wagner, Dominik
3
2021
Some results on a game-semantic approach to verifying finitely-presentable infinite structures (extended abstract). Zbl 1225.68123
Ong, C.-H. L.
2
2006
Weak and nested class memory automata. Zbl 1451.68145
Cotton-Barratt, Conrad; Murawski, Andrzej S.; Ong, C.-H. Luke
2
2015
Compositional higher-order model checking via \(\omega\)-regular games over Böhm trees. Zbl 1401.68207
Tsukada, Takeshi; Ong, C.-H. Luke
2
2014
Quantitative semantics of the lambda calculus. Some generalisations of the relational model. Zbl 1452.03046
Ong, C.-H. Luke
2
2017
Generalised species of rigid resource terms. Zbl 1452.03136
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
2
2017
The safe lambda calculus. Zbl 1162.68007
Blum, William; Ong, C.-H. Luke
2
2009
A generic strong normalization argument: Application to the calculus of constructions. Zbl 0953.03526
Ong, C.-H. L.; Ritter, E.
2
1994
Games characterizing Levy-Longo trees. Zbl 1056.68101
Ong, C.-H. L.; Di Gianantonio, P.
2
2002
An approach to deciding the observational equivalence of Algol-like languages. Zbl 1072.68031
Ong, C.-H. L.
2
2004
Safety verification of asynchronous pushdown systems with shaped stacks. Zbl 1390.68475
Kochems, Jonathan; Ong, C.-H. Luke
1
2013
Plays as resource terms via non-idempotent intersection types. Zbl 1401.68178
Tsukada, Takeshi; Ong, C.-H. Luke
1
2016
A traversal-based algorithm for higher-order model checking. Zbl 1291.68264
Neatherway, Robin P.; Ramsay, Steven J.; Ong, Chih-Hao Luke
1
2012
Model checking Algol-like languages using game semantics. Zbl 1027.68615
Ong, C.-H. L.
1
2002
Games characterizing Levy-Longo trees. Zbl 1094.91011
Ong, C.-H. L.; Di Gianantonio, P.
1
2004
Hierarchies of infinite structures generated by pushdown automata and recursion schemes. Zbl 1147.68563
Ong, C.-H. L.
1
2007
Automata, logic and games for the \(\lambda \)-calculus. Zbl 1480.03008
Ong, C.-H. Luke
1
2017
Densities of almost surely terminating probabilistic programs are differentiable almost everywhere. Zbl 1473.68048
Mak, Carol; Ong, C.-H. Luke; Paquet, Hugo; Wagner, Dominik
3
2021
Typed meta-interpretive learning of logic programs. Zbl 07169107
Morel, Rolf; Cropper, Andrew; Ong, C.-H. Luke
6
2019
Change actions: models of generalised differentiation. Zbl 07158690
Alvarez-Picallo, Mario; Ong, C.-H. Luke
3
2019
Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs. Zbl 1497.68128
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
3
2018
Collapsible pushdown automata and recursion schemes. Zbl 1407.68256
Hague, Matthew; Murawski, Andrzej S.; Ong, C.-H. Luke; Serre, Olivier
16
2017
Quantitative semantics of the lambda calculus. Some generalisations of the relational model. Zbl 1452.03046
Ong, C.-H. Luke
2
2017
Generalised species of rigid resource terms. Zbl 1452.03136
Tsukada, Takeshi; Asada, Kazuyuki; Ong, C.-H. Luke
2
2017
Automata, logic and games for the \(\lambda \)-calculus. Zbl 1480.03008
Ong, C.-H. Luke
1
2017
Unboundedness and downward closures of higher-order pushdown automata. Zbl 1347.68205
Hague, Matthew; Kochems, Jonathan; Ong, C.-H. Luke
5
2016
Plays as resource terms via non-idempotent intersection types. Zbl 1401.68178
Tsukada, Takeshi; Ong, C.-H. Luke
1
2016
Nondeterminism in game semantics via sheaves. Zbl 1401.68177
Tsukada, Takeshi; Ong, C. H. Luke
5
2015
Fragments of ML decidable by nested data class memory automata. Zbl 1459.68035
Cotton-Barratt, Conrad; Hopkins, David; Murawski, Andrzej S.; Ong, C.-H. Luke
4
2015
Weak and nested class memory automata. Zbl 1451.68145
Cotton-Barratt, Conrad; Murawski, Andrzej S.; Ong, C.-H. Luke
2
2015
A type-directed abstraction refinement approach to higher-order model checking. Zbl 1284.68414
Ramsay, Steven J.; Neatherway, Robin P.; Ong, C.-H. Luke
16
2014
Compositional higher-order model checking via \(\omega\)-regular games over Böhm trees. Zbl 1401.68207
Tsukada, Takeshi; Ong, C.-H. Luke
2
2014
Safety verification of asynchronous pushdown systems with shaped stacks. Zbl 1390.68475
Kochems, Jonathan; Ong, C.-H. Luke
1
2013
A traversal-based algorithm for higher-order model checking. Zbl 1291.68264
Neatherway, Robin P.; Ramsay, Steven J.; Ong, Chih-Hao Luke
1
2012
Verifying higher-order functional programs with pattern-matching algebraic data types. Zbl 1284.68193
Ong, C.-H. Luke; Ramsay, Steven James
17
2011
Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Zbl 1237.68124
Kobayashi, Naoki; Ong, C.-H. Luke
6
2011
A fragment of ML decidable by visibly pushdown automata. Zbl 1333.68079
Hopkins, David; Murawski, Andrzej S.; Ong, C.-H. Luke
6
2011
Improved functional flow and reachability analyses using indexed linear tree grammars. Zbl 1236.68134
Kochems, Jonathan; Ong, C. H. Luke
5
2011
A saturation method for the modal \(\mu \)-calculus over pushdown systems. Zbl 1215.68151
Hague, M.; Ong, C.-H. L.
3
2011
Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Zbl 1248.68334
Kobayashi, Naoki; Ong, C.-H. Luke
3
2009
Winning regions of pushdown parity games: a saturation method. Zbl 1254.68135
Hague, Matthew; Ong, C.-H. Luke
3
2009
The safe lambda calculus. Zbl 1162.68007
Blum, William; Ong, C.-H. Luke
2
2009
Symbolic backwards-reachability analysis for higher-order pushdown systems. Zbl 1195.68057
Hague, Matthew; Ong, C.-H. Luke
4
2007
Hierarchies of infinite structures generated by pushdown automata and recursion schemes. Zbl 1147.68563
Ong, C.-H. L.
1
2007
Syntactic control of concurrency. Zbl 1086.68087
Ghica, D. R.; Murawski, A. S.; Ong, C.-H. L.
4
2006
Fast verification of MLL proof nets via IMLL. Zbl 1367.03112
Murawski, Andrzej S.; Ong, C.-H. Luke
3
2006
Some results on a game-semantic approach to verifying finitely-presentable infinite structures (extended abstract). Zbl 1225.68123
Ong, C.-H. L.
2
2006
Safety is not a restriction at level 2 for string languages. Zbl 1119.68102
Aehlig, K.; de Miranda, J. G.; Ong, C.-H. L.
7
2005
Idealized Algol with ground recursion, and DPDA equivalence. Zbl 1085.68092
Murawski, A. S.; Ong, C.-H. L.; Walukiewicz, I.
7
2005
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. Zbl 1114.03006
Aehlig, Klaus; de Miranda, Jolie G.; Ong, C.-H. Luke
3
2005
Applying game semantics to compositional software modeling and verification. Zbl 1126.68343
Abramsky, Samson; Ghica, Dan R.; Murawski, Andrzej S.; Ong, C.-H. Luke
10
2004
On an interpretation of safe recursion in light affine logic. Zbl 1048.03049
Murawski, A. S.; Ong, C.-H. L.
9
2004
Syntactic control of concurrency. Zbl 1099.68656
Ghica, D. R.; Murawski, A. S.; Ong, C.-H. L.
3
2004
An approach to deciding the observational equivalence of Algol-like languages. Zbl 1072.68031
Ong, C.-H. L.
2
2004
Games characterizing Levy-Longo trees. Zbl 1094.91011
Ong, C.-H. L.; Di Gianantonio, P.
1
2004
Exhausting strategies, joker games and full completeness for IMLL with unit. Zbl 1029.03053
Murawski, A. S.; Ong, C.-H. L.
3
2003
Games characterizing Levy-Longo trees. Zbl 1056.68101
Ong, C.-H. L.; Di Gianantonio, P.
2
2002
Model checking Algol-like languages using game semantics. Zbl 1027.68615
Ong, C.-H. L.
1
2002
Evolving games and essential nets for affine polymorphism. Zbl 0981.03064
Murawski, Andrzej S.; Ong, C.-H. Luke
3
2001
On full abstraction for PCF: I, II and III. Zbl 1006.68027
Hyland, J. M. E.; Ong, C.-H. L.
159
2000
Discreet games, light affine logic and PTIME computation. Zbl 0973.03038
Murawski, A. S.; Ong, C.-H. L.
7
2000
Explicit substitution internal languages for autonomous and *-autonomous categories. Zbl 0967.03025
Koh, T. W.; Ong, C.-H. L.
5
1999
A generic strong normalization argument: Application to the calculus of constructions. Zbl 0953.03526
Ong, C.-H. L.; Ritter, E.
2
1994
Full abstraction in the lazy lambda calculus. Zbl 0779.03003
Abramsky, Samson; Ong, C.-H. Luke
65
1993
Modified realizability toposes and strong normalization proofs. Zbl 0793.03079
Hyland, J. M. E.; Ong, C.-H. L.
10
1993

Citations by Year