Draft:Luke Ong

Luke Ong
Alma materUniversity of Cambridge; Imperial College London
Known forGame semantics; higher-order model checking; programming languages; semantics of computation
Scientific career
FieldsComputer science
InstitutionsNanyang Technological University; University of Oxford

Chih-Hao Luke Ong (commonly cited as C.-H. L. Ong or Luke Ong) is a Singaporean computer scientist whose research spans programming languages, semantics of computation, logic, and verification. He has held academic posts at the University of Oxford and is a senior university leader at Nanyang Technological University (NTU), Singapore.[1][2][3]

Education

Ong studied at the University of Cambridge and later completed a PhD in computer science at Imperial College London.[4]

Career

Ong spent much of his academic career at the University of Oxford, where he served as a faculty member in the Department of Computer Science and as a fellow of Merton College, Oxford.[2][1]

He later joined Nanyang Technological University (NTU), Singapore, as a Distinguished University Professor, and has served in senior leadership roles at the university.[5] As of January 2026, the Singapore Government Directory lists him as Vice President (AI & Digital Economy) and Dean of NTU's College of Computing & Data Science, among other roles.[3]

Research

Ong's research includes work on the semantics of computation, programming languages, and automated verification.[1]

In verification and logic, his publications include work on model-checking problems for trees generated by higher-order recursion schemes, published in proceedings of the IEEE Symposium on Logic in Computer Science (LICS).[6]

In programming language semantics, he co-authored the paper series On Full Abstraction for PCF: I, II, and III in the journal Information and Computation.[7]

Selected works

  • Hyland, J. M. E.; Ong, C.-H. L. (2000). "On Full Abstraction for PCF: I, II, and III". Information and Computation.[7]
  • Ong, C.-H. L. (2006). "On model-checking trees generated by higher-order recursion schemes". Proceedings of LICS 2006.[6]

References

  1. ^ a b c "Dr Luke Ong: University of Oxford Homepage". University of Oxford. Retrieved 11 January 2026.
  2. ^ a b "Professor Chih-Hao Luke Ong". Merton College, University of Oxford. Retrieved 11 January 2026.
  3. ^ a b "Singapore Government Directory: NTU (University Leadership)". sgdi.gov.sg. Government of Singapore. Retrieved 11 January 2026.
  4. ^ "Personal Profiles: Professor Luke Ong". Cambridge CARES. Retrieved 11 January 2026.
  5. ^ "New senior leadership appointments for research and industry announced". NTU Singapore. Retrieved 11 January 2026.
  6. ^ a b "On model-checking trees generated by higher-order recursion schemes". IEEE Computer Society (Computer.org). Retrieved 11 January 2026.
  7. ^ a b "On Full Abstraction for PCF: I, II, and III". ScienceDirect. Elsevier. Retrieved 11 January 2026.
This page will be placed in the following categories if it is moved to the article namespace.
Categories:

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.