( en | de | ru )

 

Disambiguation of "Ong, C.-H. Luke"

Author of the publication

copydeleteadd this publication to your clipboard
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.

, , and . TLCA, volume 3461 of Lecture Notes in Computer Science, page 39-54. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

C H Johl

Prashanth H C

H C Thejaswini

Kilian Ong

Untersuchung von Schichtsystemen für kristallisierte Dünnschichtsiliziumsolarzellen auf Glas. TU Hamburg, (2009)

Hoang Ong

 

Other publications of authors with the same name

Typed Meta-interpretive Learning of Logic Programs., , and . JELIA, volume 11468 of Lecture Notes in Computer Science, page 198-213. Springer, (2019)Safety Is not a Restriction at Level 2 for String Languages., , and . FoSSaCS, volume 3441 of Lecture Notes in Computer Science, page 490-504. Springer, (2005)Two-Level Game Semantics, Intersection Types, and Recursion Schemes., and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 325-336. Springer, (2012)Syntactic Control of Concurrency., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 683-694. Springer, (2004)Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract).. ICALP, volume 623 of Lecture Notes in Computer Science, page 487-498. Springer, (1992)Idealized Algol with Ground Recursion, and DPDA Equivalence., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 917-929. Springer, (2005)Automata, Logic and Games for the λ-Calculus.. ICLA, volume 10119 of Lecture Notes in Computer Science, page 23-26. Springer, (2017)A Universal Innocent Game Model for the Böhm Tree Lambda Theory., , and . CSL, volume 1683 of Lecture Notes in Computer Science, page 405-419. Springer, (1999)Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus., and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 223-234. Springer, (2009)An approach to deciding the observational equivalence of Algol-like languages.. Ann. Pure Appl. Log., 130 (1-3): 125-171 (2004)