C.-H. L. Ong. Observational equivalence of third-order Idealized Algol is decidable. Proc. LICS'02, pp. 245--256, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Regular-Language Semantics of Second-Order Idealized ALGOL - Ghica, McCusker (2003) (Correct)
....[32] has since been expanded in two directions. The rst author has proved a similar decidability result for a call by value language, showing that it has a regular language model [31] Ong has shown that observational equivalence of the third order fragment of IA without iteration is decidable [33] by showing that its game model can be represented using deterministic context free languages. Finally, Murawski has shown that higher order fragments of imperative procedural languages, call by name or call by value, are not decidable [34] Another direction of research is the application of the ....
C.-H. L. Ong, Observational equivalence of third-order Idealized Algol is decidable, in: Proceedings of IEEE Symposium on Logic in Computer Science, 2002.
Nominal Games and Full Abstraction for the Nu-Calculus - Abramsky, Ghica.. Self-citation (Ong) (Correct)
No context found.
C.-H. L. Ong. Observational equivalence of third-order Idealized Algol is decidable. Proc. LICS'02, pp. 245--256, 2002.
An approach to deciding observational equivalence of Algol-like.. - Ong Self-citation (Ong) (Correct)
....directions in Section 7. Readers who are familiar with the game semantics of Idealized Algol may wish to skip the next two sections and go straight to Section 4, and return to Section 3 at a later stage for the new material on game semantics. An extended abstract of this paper has appeared as [28]. 2 Idealized Algol Reynolds Idealized Algol (IA for short) 33] is a compact language that elegantly combines state based procedural and higher order functional programming. The basis of IA is a simply typed call by name calculus in which the standard constructs of imperative programming and ....
C.-H. L. Ong. Observational equivalence of third-order Idealized Algol is decidable. In Proceedings of IEEE Symposium on Logic in Computer Science, 22-25 July 200, Copenhagen Denmark, pages 245-256. Computer Society Press, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC