Remember Me
Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Murawski, Andrzej S.; Tzevelekos, Nikos (2014)
Publisher: Springer
Languages: English
Types: Part of book or chapter of book
Subjects: QA76

Classified by OpenAIRE into

arxiv: Computer Science::Programming Languages
We present a fully abstract denotational model for a higher-order programming language combining call-by-value evaluation and local exceptions. The model is built using nominal game semantics and is the first one to achieve both effective presentability and freedom from “bad exception” constructs.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1. S. Abramsky, D. R. Ghica, A. S. Murawski, C.-H. L. Ong, and I. D. B. Stark. Nominal games and full abstraction for the nu-calculus. In LICS'04.
    • 2. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
    • 3. K. Honda and N. Yoshida. Game-theoretic analysis of call-by-value computation. Theoretical Computer Science, 221(1-2):393-456, 1999.
    • 4. J. Laird. A semantic analysis of control. PhD thesis, University of Edinburgh, 1998.
    • 5. J. Laird. A fully abstract games semantics of local exceptions. In LICS'01.
    • 6. J. Laird. A game semantics of local names and good variables. In FOSSACS'04.
    • 7. J. Laird. A game semantics of names and pointers. Ann. Pure Appl. Logic, 151:151-169, 2008.
    • 8. J. Laird. Combining and relating control effects and their semantics. In COS, 2013.
    • 9. E. Moggi. Notions of computation and monads. Inf. and Comput., 93:55-92, 1991.
    • 10. A. S. Murawski and N. Tzevelekos. Game semantics for good general references. In LICS'11.
    • 11. A. S. Murawski and N. Tzevelekos. Algorithmic games for full ground references. ICALP'12.
    • 12. A. S. Murawski and N. Tzevelekos. Full abstraction for Reduced ML. Ann. Pure Appl. Logic, 164(11):1118-1143, 2013.
    • 13. J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J.C. van Vliet, editors, Algorithmic Languages, pages 345-372. North Holland, 1981.
    • 14. I. D. B. Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, 1995. Technical Report No. 363.
    • 15. N. Tzevelekos. Nominal game semantics. D.Phil. thesis, Oxford University, 2008.
    • 16. N. Tzevelekos. Full abstraction for nominal general references. LMCS, 5(3), 2009.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok