K. Wansbrough and S. Jones. Simple usage polymorphism, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....constraints as part of a type. A problem in practice is that constraint sets can become very large. Trifonov and Smith [TS96] as well as Pottier [Pot98] have proposed schemes to address the problem. A more radical alternative has been proposed by Nordlander [Nor98] and Peyton Jones and Wansbrough [WJ00] They approximate constrained types with unconstrained types in the generalization step. Nordlander s system [Nor98] heuristically unifies type variables with their bounds. He uses a scheme similar to ours to pass partial type information, treating wildcards (that correspond to our ) as ....

Keith Wansbrough and Simon Peyton Jones. Simple usage polymorphism. In Proceedings of the Third ACM SIGPLAN Workshop on Types in Compilation, September 2000.

....constraints as part of a type. A problem in practice is that constraint sets can become very large. Trifonov and Smith [TS96] as well as Pottier [Pot98] have proposed schemes to address the problem. A more radical alternative has been proposed by Nordlander [Nor98] and Peyton Jones and Wansbrough [WJ00] They approximate constrained types with unconstrained types in the generalization step. Nordlander s system [Nor98] heuristically unifies type variables with their bounds. He uses a scheme similar to ours to pass partial type information, treating wildcards (that correspond to our ) as ....

Keith Wansbrough and Simon Peyton Jones. Simple usage polymorphism. In Proceedings of the Third ACM SIGPLAN Workshop on Types in Compilation, September 2000.

....those on variables in the assumption environment, at the earliest stage possible, thus its behavior can sometimes appear quite unpredictable. In the specific setting of usage analysis, Wansbrough and Peyton Jones describe a constraint approximating algorithm that has similarities to our approach [WP00] They share our objective to infer constraint free types only, they resort to unification for variable to variable constraints, and they also notice the problems inherent in finding a precise specification for such an algorithm. Nevertheless, many di#culties are avoided in their system due to ....

Keith Wansbrough and Simon Peyton Jones. Simple usage polymorphism. In Third ACM SIGPLAN Workshop on Types in Compilation, September 2000. 34

.... [16] as well as polyvariant analysis for a monomorphic language [7] The situation is similar for other analyses; for example, recent progress in usage analysis deals with either usage monomorphic analysis for a polymorphic language [27] or usagepolymorphic analysis for a monomorphic language [28]. To our knowledge, this is the rst time polyvariant binding time analysis has been developed and implemented for a polymorphic language. Also, to the best of our knowledge, we present the rst formalisation of the underlying binding time logic. Owing to limited space, we concentrate on the core ....

K. Wansbrough and S. L. Peyton Jones. Simple usage polymorphism. In Third ACM SIGPLAN Workshop on Types in Compilation (TIC 2000), 2000.

....constraints as part of a type. A problem in practice is that constraint sets can become very large. Trifonov and Smith [TS96] as well as Pottier [Pot98] have proposed schemes to address the problem. A more radical alternative has been proposed by Nordlander [Nor98] and Peyton Jones and Wansbrough [WJ00] They approximate constrained types with unconstrained types in the generalization step. Nordlander s system [Nor98] heuristically unifies type variables with their bounds. He uses a scheme similar to ours to pass partial type information, treating wildcards (that correspond to our ) as ....

Keith Wansbrough and Simon Peyton Jones. Simple usage polymorphism. In Proceedings of the Third ACM SIGPLAN Workshop on Types in Compilation, September 2000.

....(extended with polymorphism) a re nement of a linear type system for memory management, would be a good base of our system. We also should explore the design space about polymorphism, involving many engineering tradeo s between the power of the type system and the overhead of type reconstruction [WJ99,WJ00]. Reduction of run time cost. One of the main potential run time overheads of our memory management would lie in deallocation of linear values involving dynamic check of uses, even though the check can be implemented without extra memory space for tags. To omit those checks, we might be able to ....

Keith Wansbrough and Simon Peyton Jones. Simple usage polymorphism. In Proceedings of the 3rd International Workshop on Types in Compilation (TIC), Montreal, Canada, September 2000.

....When analysing large programs it is crucial to take the context into account when Wansbrough and Peyton Jones implemented the recent analysis from [WPJ99] into the Glasgow Haskell Compiler they discovered that it was almost useless in practice since it did not scale up for large programs. WPJ00] In this paper we present a powerful and accurate type system which attempts to solve this problem. It takes the context where a function is called into account through the means of bounded usage polymorphism. We designed our type system by putting together and extending the best ideas from ....

....relationship between the different degrees of approximations computed by his algorithm and our type system is not clear to us. The aim of this work is to make usage analysis scale up for large programs and in that respect it is most closely related to recent work by Wansbrough and Peyton Jones [WPJ00] They have also observed that usage polymorphism is crucial for the accuracy of the analysis of large programs but they side step the difficulties associated with bounded polymorphism. Instead they have usage polymorphism where the quantified variables may not be constrained. This is achieved by ....

Keith Wansbrough and Simon Peyton Jones. Simple Usage Polymorphism. In ACM SIGPLAN Workshop on Types in Compilation, 2000. To appear.

No context found.

K. Wansbrough and S. Jones. Simple usage polymorphism, 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