88 search results - page 2 / 18 » A Fully Abstract Trace Semantics for General References |
FOSSACS
2009
Springer
14 years 26 days ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
AI
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
SEFM
2008
IEEE
14 years 14 days ago
2008
IEEE
Abstract. Algebraic laws have been proposed to support program transformation in several paradigms. In general, and for object-orientation in particular, these laws tend to ignore ...
FOSSACS
2009
Springer
14 years 26 days ago
2009
Springer
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
BIRTHDAY
2007
Springer
14 years 8 days ago
2007
Springer
We present a denotational semantics for a fully functional subset of the Handel-C hardware compilation language [1], based on the concept of typed assertion traces. We motivate the...