Decidability and syntactic control of interference
From MaRDI portal
Publication:2481977
DOI10.1016/j.tcs.2007.10.045zbMath1136.68034MaRDI QIDQ2481977
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.045
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the semantics of the bad-variable constructor in Algol-like languages
- The equivalence problem of multitape finite automata
- The inclusion problem for some classes of deterministic multitape automata
- Syntactic control of interference revisited
- Game semantics and linear CPS interpretation
- On full abstraction for PCF: I, II and III
- The regular-language semantics of second-order idealized ALGOL
- An approach to deciding the observational equivalence of Algol-like languages
- Foundations of Software Science and Computational Structures
- Automata, Languages and Programming
- Finitary PCF is not decidable