A Uniied Approach to Strictness Analysis and Optimising Transformations
نویسنده
چکیده
We present an inference system for translating programs in a PCF-like source language into a variant of Moggi's computational lambda calculus. This translation combines a simple strictness analysis with its associated optimising transformations into a single system. The correctness of the translation is established using a logical relation between the denotational semantics of the source and target languages.
منابع مشابه
Optimising Compilation
This lecture considers the optimisation of functional programming languages (particularlyìazy' languages) based on`strictness analysis'. Such optimisations alter evaluation order to allow more eecient translation into von Neumann architecture or to increase the parallelism in a sequentially speciied system (such as that implied by lazy-semantics).
متن کاملCps - Translation and the Correctness of Optimising
We show that compiler optimisations based on strictness analysis can be expressed formally in the functional framework using continuations. This formal presentation has two beneets: it allows us to give a rigorous correctness proof of the optimised compiler; and it exposes the various optimisations made possible by a strictness analysis. These beneets are especially signiicant in the presence o...
متن کاملAnalysis of the Uniied Transformations
We show the singular values of the uniied transformations 6], propose pivoting strategies for downdating, and present a stability analysis.
متن کاملUnifying Unitary and Hyperbolic Transformations
In this paper we describe uniied formulas for unitary and hyperbolic reeections and rotations, and show how these uniied transformations can be used to compute a Hermitian triangular decomposition ^ R H D ^ R of a strongly nonsingular indeenite matrix ^ A given in the form ^ The uniication is achieved by the introduction of signature matrices which determine whether the applicable transformatio...
متن کاملCompiling Laziness Using Projection Types
Strictness analysis is accepted as an important tool for the eecient implementation of lazy functional languages. However, the analyses are usually rst-order and the optimisations that follow may be ad hoc. Using projections to represent static properties of programs is appealing because they naturally describe component-wise demand on data structures and can handle latent demands such as head-...
متن کامل