Type algebras, functor categories and block structure
Algebraic methods in semantics
Game-theoretic analysis of call-by-value computation
Theoretical Computer Science
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Observational Equivalence of 3rd-Order Idealized Algol is Decidable
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Functions with local state: regularity and undecidability
Theoretical Computer Science
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
Semantics for Local Computational Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithmic nominal game semantics
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
A fragment of ML decidable by visibly pushdown automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
| Hi-index | 0.00 |
We study the semantic meaning of block structure using game semantics and introduce the notion of block-innocent strategies, which turns out to characterise call-by-value computation with block-allocated storage through soundness, finitary definability and universality results. This puts us in a good position to conduct a comparative study of purely functional computation, computation with block storage and dynamic memory allocation respectively. For example, we show that dynamic variable allocation can be replaced with block-allocated variables exactly when the term involved (open or closed) is of base type and that block-allocated storage can be replaced with purely functional computation when types of order two are involved. To illustrate the restrictive nature of block structure further, we prove a decidability result for a finitary fragment of call-by-value Idealized Algol for which it is known that allowing for dynamic memory allocation leads to undecidability.