668 search results - page 113 / 134 » Operational semantics for multi-language programs |
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
SAS
2007
Springer
14 years 2 months ago
2007
Springer
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
POPL
1996
ACM
14 years 5 days ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
ECOOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...