Block structure vs scope extrusion: between innocence and omniscience
From MaRDI portal
Publication:2974774
DOI10.2168/LMCS-12(3:3)2016zbMath1398.68096arXiv1605.02311MaRDI QIDQ2974774
Nikos Tzevelekos, Andrzej S. Murawski
Publication date: 11 April 2017
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02311
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Functions with local state: regularity and undecidability
- A new approach to abstract syntax with variable binding
- LCF considered as a programming language
- Full abstraction for idealized Algol with passive expressions
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Game-theoretic analysis of call-by-value computation
- Fragments of ML Decidable by Nested Data Class Memory Automata
- A Fragment of ML Decidable by Visibly Pushdown Automata
- Full abstraction for nominal general references
- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
- Regular-Language Semantics for a Call-by-Value Programming Language
- About the undecidability of program equivalence in finitary languages with state
- Automata, Languages and Programming
This page was built for publication: Block structure vs scope extrusion: between innocence and omniscience