Skip to main content
Conference ProceedingsOPEN ACCESS

Game semantics for nominal exceptions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8412 LNCS 164-179
DOI: 10.1007/978-3-642-54830-7_11
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Murawski, A. S., & Tzevelekos, N. (2014). Game semantics for nominal exceptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8412 LNCS, pp. 164–179). Springer Verlag. https://doi.org/10.1007/978-3-642-54830-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free