Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Abstractions - Gustavsson, Svenningsson Self-citation (Svenningsson) (Correct)
....express substitution instantiation. The main result of this paper is a constraint solving algorithm which computes least solutions to the extended form of constraints in cubic time. We have used this expressive constraint language to formulate usage polymorphic usage analyses with usage subtyping [Sve00,GS00] and an algorithm closely related to the one in this paper is presented in the second author s Master s thesis [Sve00] GS00] focuses on the usage type system and no constraint solving is presented) In this paper, as another example, we show how the constraint language can be used to yield a ....
....to the extended form of constraints in cubic time. We have used this expressive constraint language to formulate usage polymorphic usage analyses with usage subtyping [Sve00,GS00] and an algorithm closely related to the one in this paper is presented in the second author s Master s thesis [Sve00] ( GS00] focuses on the usage type system and no constraint solving is presented) In this paper, as another example, we show how the constraint language can be used to yield a cubic algorithm for Mossin s polymorphic flow analysis with flow subtyping and flow polymorphic recursion [Mos97] This ....
[Article contains additional citation context not shown here]
Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000.
Constraint Abstractions - Gustavsson, Svenningsson (2000) Self-citation (Svenningsson) (Correct)
....express substitution instantiation. The main result of this paper is a constraint solving algorithm which computes least solutions to the extended form of constraints in cubic time. We have used this expressive constraint language to formulate usage polymorphic usage analyses with usage subtyping [Sve00,GS00] and an algorithm closely related to the one in this paper is presented in the second author s Master s thesis [Sve00] GS00] focuses on the usage type system and no constraint solving is presented) In this paper, as another example, we show how the constraint language can be used to yield a ....
....to the extended form of constraints in cubic time. We have used this expressive constraint language to formulate usage polymorphic usage analyses with usage subtyping [Sve00,GS00] and an algorithm closely related to the one in this paper is presented in the second author s Master s thesis [Sve00] ( GS00] focuses on the usage type system and no constraint solving is presented) In this paper, as another example, we show how the constraint language can be used to yield a cubic algorithm for Mossin s polymorphic flow analysis with flow subtyping and flow polymorphic recursion [Mos97] This ....
[Article contains additional citation context not shown here]
Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000.
A Usage Analysis With Bounded Usage Polymorphism and.. - Gustavsson, Svenningsson (2000) (3 citations) Self-citation (Svenningsson) (Correct)
.... recursion we have an algorithm with a worst case complexity of O(n m t 2 ) where n is the size of the untyped lambda lifted version of the program, m is the size of the type of the largest set of (properly) mutually recursive definitions and t is the size of the largest instantiated type [Sve00] Since m and t typically grow slowly or not at all with program size we expect the algorithm to scale up well in practice. We believe that a generalisation of the form of constraints used in this paper can be useful for a range of program analyses which features bounded polymorphism. We are ....
....its semantics in the form of an abstract machine. 2.1 Syntax The language we use is a lambda calculus extended with integers, lists, caseexpressions and recursive let expressions. We omit user defined data structures to simplify the presentation but it is a straightforward matter to add them [Sve00] Variables x; y; z Values v : x:e j n j nil j cons x y Expressions e : v j x j e x j e 0 e 1 j let b 1 ; b n in e j case e of alts Bindings b : x = e Alternatives alts : fnil ) e 0 ; cons x y ) e 1 g Annotations : 1 j We annotate bindings, values and with usage ....
Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000.
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