eCommons

 

Relational Semantics of Local Variable Scoping

dc.contributor.authorAboul-Hosn, Kamalen_US
dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-04T19:46:22Z
dc.date.available2007-04-04T19:46:22Z
dc.date.issued2005-07-18en_US
dc.description.abstractMost previous work on the equivalence of programs in the presence of local state has involved intricate memory modeling and the notion of contextual (observable) equivalence. We show how relational semantics can be used to avoid these complications. We define a notion of local variable scoping, along with a purely compositional semantics based on binary relations, such that all contextual considerations are completely encapsulated in the semantics. We then give an axiom system for program equivalence in the presence of local state that avoids all mention of memory or context and that does not use semantic arguments. The system is complete relative to the underlying flat equational theory. We also indicate briefly how the semantics can be extended to include higher-order functions.en_US
dc.format.extent175156 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2005-2000en_US
dc.identifier.urihttps://hdl.handle.net/1813/5700
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleRelational Semantics of Local Variable Scopingen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR2005-2000.pdf
Size:
171.05 KB
Format:
Adobe Portable Document Format