Results 1 - 10 of 414

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

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 11 (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

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

Polymorphic Splitting: An Effective Polyvariant Flow Analysis

by Andrew K. Wright, Suresh Jagannathan - ACM Transactions on Programming Languages and Systems , 1998
"... values for our framework are defined as follows: a 2 Avalue = Aconst +Aclosure b 2 Aconst = ftrue; false; number; nilg hl; ae; i 2 Aclosure = Label \Theta Aenv \Theta Contour ae 2 Aenv = Var fin \Gamma! Contour 2 Contour = Label An abstract value a is a set of abstract constants and abstra ..."
Abstract - Cited by 27 (0 self) - Add to MetaCart
values for our framework are defined as follows: a 2 Avalue = Aconst +Aclosure b 2 Aconst = ftrue; false; number; nilg hl; ae; i 2 Aclosure = Label \Theta Aenv \Theta Contour ae 2 Aenv = Var fin \Gamma! Contour 2 Contour = Label An abstract value a is a set of abstract constants

Separate Polyvariant Binding Time Reconstruction

by Charles Consel, Pierre Jouvelot, Peter Ørbæk - CRI Report A/261, Ecole des Mines , 1994
"... Binding time analysis aims at determining which identifiers can be bound to their values at compile time. This binding time information is of utmost importance when performing partial evaluation or constant folding on programs. Existing binding time analyses are global in that they require complete ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
when considering programming in-the-large; any modification of an application results in the reprocessing of all the modules. This paper presents a new static analysis for higher-order typed functional languages that relies on a type and e#ect system to obtain polyvariant and separate binding time

A polyvariant type analysis for Erlang

by Sven-olof Nyström - In preparation
"... Abstract. This paper presents a type analysis for the programming language Erlang. The analysis computes interprocedural control-flow and data-flow information, and should be applicable to any higher-order functional programming language with call-by-value semantics. The analysis uses a novel method ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. This paper presents a type analysis for the programming language Erlang. The analysis computes interprocedural control-flow and data-flow information, and should be applicable to any higher-order functional programming language with call-by-value semantics. The analysis uses a novel

Polyvariant constructor specialisation

by Dirk Dussart, Eddy Bevers, Karel De Vlaminck - In Proc. ACM Conference on Partial Evaluation and Program Manipulation , 1995
"... In his PEPM’93 paper Mogensen introduced a new off-line specialisation technique, constructor specialisation. What differentiates constructor specialisation from conventiomd specialisation techniques is the ability to specialise construc- ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
In his PEPM’93 paper Mogensen introduced a new off-line specialisation technique, constructor specialisation. What differentiates constructor specialisation from conventiomd specialisation techniques is the ability to specialise construc-
Results 1 - 10 of 414