Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
3 results

Full abstraction for nominal general references

Nikos Tzevelekos.
Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modelling functional languages with names. These are ordinary, stateful&nbsp;[&hellip;]
Published on September 11, 2009
Volume 5, Issue 3

History-Register Automata

Radu Grigore ; Nikos Tzevelekos.
Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs extend the expressiveness of previous&nbsp;[&hellip;]
Published on March 29, 2016
Volume 12, Issue 1

Block structure vs scope extrusion: between innocence and omniscience

Andrzej S. Murawski ; Nikos Tzevelekos.
We study the semantic meaning of block structure using game semantics. To that end, we introduce the notion of block-innocent strategies and characterise call-by-value computation with block-allocated storage through soundness, finite definability and universality results. This puts us in a good&nbsp;[&hellip;]
Published on April 27, 2017
Volume 12, Issue 3
  • < Previous
  • 1
  • Next >