Titlebook: Semantics, Applications, and Implementation of Program Generation; Second International Walid Taha Conference proceedings 2001 Springer-Ver

字謎游戲

等待

MetaKlaim: Meta-programming for Global Computingking about the . dimension. In particular, withno central control and the need to operate with incomplete information there is a compelling need to interleave meta-programming activities (like assembly and linking of code fragments), security checks (like type-checking at administrative boundaries)

Robust

BOOST

狂怒

Static Transition Compressionsitional and context-sensitive specification that provably gives rise to no static chains of jumps, no redundant labels, and no unused labels. It is defined with one inference rule per syntactic construct and operates in linear time and space on the size of the source program (indeed it operates in one pass).

CHAR

compose

Dynamically Adaptable Software with Metacomputations in a Staged Languageacomputation-style language definitions and the staging constructs of MetaML. We believe that the approach to implementing profile-driven optimizations presented here suggests a useful, formal model for dynamically adaptable software

夾克怕包裹

A Transformational Approach which Combines Size Inference and Program Optimizationguage ...We believe that analysis and parallelization work best if higher-order functions are used to compose the program from functional building blocks, so-called skeletons, instead of using unrestrained recursion. Skeletons, e.g., data-parallel combinators come with a theory of sizes and parallelization.

Outwit

MetaKlaim: Meta-programming for Global Computingain control of the temporal aspects, while Klaim allows to model and program the spatial aspects of distributed concurrent applications. Our approachfor combining these aspects is quite general and should be applicable to other languages/systems for network programming.

anagen

Short Cut Fusion: Proved and Improvedsubstitution instances of its associated data structures. Together with the well-known generalization cata of foldr to arbitrary algebraic data types, this allows us to formulate and prove correct for each a contextual equivalence-preserving cata-augment fusion rule. These rules optimize composition