Regular-Language Semantics for a Call-by-Value Programming Language-Reference-Cited by-同舟云学术

Regular-Language Semantics for a Call-by-Value Programming Language

Published:2001-11 Issue: Volume:45 Page:106-118
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Ghica Dan R.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Abramsky S., K. Honda and G. McCusker, A fully abstract game semantics for general references, in: Proceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998.

2. Full abstraction for PCF;Abramsky;Lecture Notes in Computer Science,1994

3. Abramsky S. and G. McCusker, Game semantics, lecture notes, 1997 Marktoberdorf summer school (available from http://www.dcs.ed.ac.uk/home/samson/mdorf97.ps.gz).

4. Abramsky S. and G. McCusker, Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions, in: O'Hearn and Tennent [14] pp. 297–329, two volumes.

5. Call-by-value games;Abramsky;CSL: 11th Workshop on Computer Science Logic,1998

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Fragment of ML Decidable by Visibly Pushdown Automata;Automata, Languages and Programming;2011

2. Syntactic control of concurrency;Theoretical Computer Science;2006-02

3. Functions with local state: Regularity and undecidability;Theoretical Computer Science;2005-06

4. Syntactic Control of Concurrency;Automata, Languages and Programming;2004

5. The regular-language semantics of second-order idealized ALGOL;Theoretical Computer Science;2003-12