loading...
On Program Equivalence in Languages with Ground-Type References
Ottawa, Canada June 22-June 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2003.121005018th Annual IEEE Symposium on Logic i ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Andrzej S. Murawski, "On Program Equivalence in Languages with Ground-Type References," Logic in Computer Science, Symposium on, pp. 108, 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2003.1210050,
author = {Andrzej S. Murawski},
title = {On Program Equivalence in Languages with Ground-Type References},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2003},
issn = {1043-6871},
pages = {108},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2003.1210050},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - On Program Equivalence in Languages with Ground-Type References
SN - 1043-6871
SP
EP
A1 - Andrzej S. Murawski,
PY - 2003
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Andrzej S. Murawski, Oxford University Computing Laboratory
Using game semantics we prove that program equivalence is undecidable in finitary Idealized Algol with active expressions as well as in its call-by-value counterpart.
It is also shown that strategies corresponding to Idealized Algol terms of respectively second, third and higher orders define exactly regular, context-free and recursively enumerable languages.
Citation:
Andrzej S. Murawski, "On Program Equivalence in Languages with Ground-Type References," lics, pp.108, 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.