• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 9 of 9

A Calculus with Polymorphic and Polyvariant Flow Types

by J. B. Wells, Allyn Dimock, Robert Muller, Franklyn Turbak
"... We present # CIL , a typed #-calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. The key innovation of # CIL is a novel formulation of intersection and union types and flow labels on both terms and ..."
Abstract - Cited by 31 (11 self) - Add to MetaCart
We present # CIL , a typed #-calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. The key innovation of # CIL is a novel formulation of intersection and union types and flow labels on both terms

Polyvariance, Polymorphism and Flow Analysis

by Karl-Filip Faxen
"... Flow analysis is a potentially very useful analysis for higher order functional languages, but its practical application has been slow in coming, partially hindered by shortcomings of the current analysis techniques. Among these are the limited precision, long analysis times, incompatibility wit ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
polymorphism, in a constraint based formulation. The type system is "soft" in the sense that it does not reject programs. It is also not decidable, but there is a broad spectrum of sound and terminating, though incomplete, algorithms whose precision can be characterized by restricting

From Polyvariant Flow Information to Intersection and Union Types

by Jens Palsberg , Christina Pavlopoulou - J. FUNCT. PROGRAMMING , 1998
"... Many polyvariant program analyses have been studied in the 1990s, including k-CFA, polymorphic splitting, and the cartesian product algorithm. The idea of polyvariance is to analyze functions more than once and thereby obtain better precision for each call site. In this paper we present an equivalen ..."
Abstract - Cited by 43 (7 self) - Add to MetaCart
in terms of polyvariant flow information. We use the theorem as basis for a new flow-type system in the spirit of the CIL -calculus of Wells, Dimock, Muller, and Turbak, in which types are annotated with flow information. A flow-type system is useful as an interface between a owanalysis algorithm and a

Compiling with Polymorphic and Polyvariant Flow Types

by Franklyn Turbak, Allyn Dimock, Robert Muller, J. B. Wells - In ACM SIGPLAN Workshop on Types in Compilation , 1997
"... Optimizing compilers for function-oriented and object-oriented languages exploit type and flow information for efficient implementation. Although type and flow information (both control and data flow) are inseparably intertwined, compilers usually compute and represent them separately. Partially, th ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
, this has been a result of the usual polymorphic type systems using 8 and 9 quantifiers, which are difficult to use in combination with flow annotations. In the Church Project, we are experimenting with intermediate languages that integrate type and flow information into a single flow type framework

Polyvariant Flow Analysis with Constrained Types

by Scott F. Smith, Tiejun Wang - In Proc. European Symp. on Programming , 2000
"... . The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Product Algorithm (CPA) and Shivers' nCFA. In this paper we develop a novel framework for polyvariant flow analysis based on ..."
Abstract - Cited by 11 (6 self) - Add to MetaCart
. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Product Algorithm (CPA) and Shivers' nCFA. In this paper we develop a novel framework for polyvariant flow analysis based

Faithful Translations between Polyvariant Flows and Polymorphic Types

by Torben Amtoft, Ranklyn Turbak , 2000
"... Recent work h& s h wn equivalences between various type systems and flow logics. Ideally, th translations upon wh= h such equivalences are basedshd&@ be faithful in th sense the information is not lost in round-trip translations from flows to types and back or from types to flows and back. B ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
. Building on t h work of Nielson Nielson and of Palsberg Pavlopoulou, we present t h firstfaithT# translations between a class of finitary polyvariant flow analyses and a type system supporting polymorph@@ in th form of intersection and union types. Additionally, our flow/type correspondence solves several

Dynamic Data Polyvariance Using Source-Tagged Classes

by S. Alexander Spoon, Olin Shivers , 2005
"... The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow, such as Smalltalk or Scheme. Because it is demand-driven and employs search pruning, it scales to large code bases. Howev ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
. However, versions of the algorithm previously described [19] do not handle data polymorphism well, conservatively merging separate data flows that go through distinct instantiations of a collection type. In this paper, we describe a new extension to DDP that helps to disentangle these flows, permitting

Polymorphic binding time analysis

by Christian Mossin - In Proceedings of ESOP'94, European Symposium on Programming , 1994
"... Binding time analysis has proved to be a valuable pre-analysis for partial evaluation. Until now (almost) all binding time analyses have been monovariant, such that binding time analysis could assign only one binding time description to each function definition. This means that if a function f(x) is ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
(x) is called once with dynamic data, no reductions on x can be performed in the body of f even when f is called with static data. There is currently great interest in polyvariant binding time analysis. Gengler and Rytz [Gengler & Rytz 1992a, Gengler & Rytz 1992b] use a kind of repeated abstract

Abstract

by Franklyn Turbak, Allyn Dimock, Robert Muller, J. B. Wells , 1997
"... Optimizing compilers for function-oriented and object-oriented languages exploit type and flow information for efficient implementation. Although type and flow information (both control and data flow) are inseparably intertwined, compilers usually compute and represent them separately. Partially, th ..."
Abstract - Add to MetaCart
polymorphism and (in combination with the labels) polyvariant flow analysis. Accurate flow types expose opportunities for a wide range of optimizing program transformations. This paper is organized as follows. In section 1, we explain the background of the use of types and flow information in compilation
Results 1 - 9 of 9
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University