Sciweavers

4355 search results - page 253 / 871
» From Interpretation to Compilation
Sort
View
ENTCS
2002
114views more  ENTCS 2002»
15 years 7 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
LICS
2006
IEEE
16 years 1 months ago
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. ...
JSAI
2007
Springer
16 years 1 months ago
Inverse Scope as Metalinguistic Quotation in Operational Semantics
We model semantic interpretation operationally: constituents interact as their combination in discourse evolves from state to state. The states are recursive data structures and ev...
Chung-chieh Shan
POPL
2008
ACM
16 years 7 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
OOPSLA
2009
Springer
16 years 1 months ago
Enhancing source-level programming tools with an awareness of transparent program transformations
Programs written in managed languages are compiled to a platform-independent intermediate representation, such as Java bytecode. The relative high level of Java bytecode has engen...
Myoungkyu Song, Eli Tilevich