Ross Paterson. Compiling laziness using projections. In Static Analysis Symposium, volume 1145 of Lecture Notes in Computer Science, pages 255--269. Springer, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Compiling Laziness Using Projection Types - Baker-Finch (Correct)
....Benton [3] presents optimising transformation rules that extend a strictness type system, as we attempt in this paper. A common limitation is that these authors deal with simple strictness information, that is, whether or not a function s arguments will be evaluated. More recently, Paterson [24] showed how to transform lazy functions using the information from projection analysis, which includes latent demands on data structures. That is, we may not know whether a data structure will be evaluated but if it is, certain subcomponents will be University of Canberra, Australia. ....
....The link between unboxed types and partial projections was noted in [22] partial projections give rise to the same unpointed domains that are used to model unboxed types. For example, the image of boxed integers Z under Str is the unboxed integers Z. To formalise this connection Paterson [24] brought embedding projection factorisation to bear. A projection ff can be presented as ff P ffi ff E (the embedding part is ff E and the projection part is ff P ) where ff P ffi ff E v Ide and ff E ffi ff P = Ide. 1 For a partial projection ff : t ffi t we have ff P a partial ....
[Article contains additional citation context not shown here]
Ross Paterson. Compiling laziness using projections. In Static Analysis Symposium, volume 1145 of Lecture Notes in Computer Science, pages 255--269. Springer, 1996.
Automatic Extraction of Context Information From Programs .. - Schütz, Schmidt-Schauß (1997) (Correct)
....above. This representation of evaluators is also able to express head strictness, a property that not all approaches to strictness and context analysis are able to express [BHA85, Bur89, HW87] The context head defined as fhead = hBot; Bot: Topig represents the head strict evaluator. Paterson [Pat96] uses the notion of latent demand to stand for contexts in which an evaluation to WHNF is not necessary, but if such an evaluation will become 21 necessary then it is known that an even stronger demand on the application is given. In our framework this can be modeled by contexts in which there is ....
Ross Paterson. Compiling laziness using projections. In Static Analysis Symposium, volume 1145 of LNCS, pages 255--269, Aachen, Germany, September 1996. Springer.
Parametricity and Unboxing with Unpointed Types - Launchbury, Paterson (1996) (8 citations) Self-citation (Paterson) (Correct)
....of projection based strictness analysis [17] For example, the image of the headstrict projection on lists of integers is exactly the lists of unboxed integers. With explicit lifting, this may be formalized by factoring projections as embeddingprojection pairs, as is done in a related paper [8]. 7 Recursive Type Definitions To complete the picture of the interaction between Pointed constraints and the features of a typical functional language, we now consider recursively defined types. The semantics of these types is customarily described using a colimit construction [13] That is, to ....
Ross Paterson. Compiling laziness using projections, October 1995. Draft.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC