Search

• < Previous
• 1
• Next >

---

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;]

---

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;]

---