807 search results - page 122 / 162 » Model Transformation Language MOLA |
IFL
2004
Springer
14 years 1 months ago
2004
Springer
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
ASPLOS
1994
ACM
13 years 11 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
ICESS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Synchronous models are useful for designing real-time embedded systems because they provide timing control and deterministic concurrency. However, the semantics of such m...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...