From polyvariant flow information to intersection and union types

Palsberg, Jens; Pavlopoulou, Christina

doi:10.1145/268946.268963

Cited by 42 publications

(39 citation statements)

References 55 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is different from, and 1 These fine tuning options are omitted from this paper due to lack of space, but they are described in detail in the implementation's documentation. 2 Indeed it is well known [20,3] that the difference between an advanced flow analysis and an advanced type system is often just a question of different perspectives on the same underlying machinery. The presentation of Poly✶ is closer to the data-flow viewpoint than is common for type systems, though this of course does not make Poly✶ any less a type system.…”

Section: Spatial Polymorphismmentioning

confidence: 99%

Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close

Makholm¹,

Wells²

2005

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Many different mobile process calculi have been invented, and for each some number of type systems has been developed. Soundness and other properties must be proved separately for each calculus and type system. We present the generic polymorphic type system Poly✶ which works for a wide range of mobile process calculi, including the π-calculus and Mobile Ambients. For any calculus satisfying some general syntactic conditions, well-formedness rules for types are derived automatically from the reduction rules and Poly✶ works otherwise unchanged. The derived type system is automatically sound (i.e., has subject reduction) and often more precise than previous type systems for the calculus, due to Poly✶'s spatial polymorphism. We present an implemented type inference algorithm for Poly✶ which automatically constructs a typing given a set of reduction rules and a term to be typed. The generated typings are principal with respect to certain natural type shape constraints.

show abstract

Section: Spatial Polymorphismmentioning

confidence: 99%

Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close

Makholm¹,

Wells²

2005

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…We show how 0CFA and CPA can be expressed as instantiations of the framework. Other frameworks for polyvariant analysis have been proposed, including [PP98,JW95].…”

Section: A Framework For Object-oriented Constraint Inferencementioning

confidence: 99%

Precise Constraint-Based Type Inference for Java

Wang

Smith

2001

ECOOP 2001 — Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose significant difficulty for type inference, in particular data polymorphism. Agesen's Cartesian Product Algorithm (CPA) can analyze programs with parametric polymorphism in a reasonably precise and efficient manner, but CPA loses precision for programs with data polymorphism. This paper presents a precise constraintbased type inference system for Java. It uses Data-Polymorphic CPA (DCPA), a novel constraint-based type inference algorithm which extends CPA with the ability to accurately and efficiently analyze data polymorphic programs. The system is implemented for the full Java language, and is used to statically verify the correctness of Java downcasts. Benchmark results are given which show that DCPA is significantly more accurate than CPA and the efficiency of DCPA is close to CPA.

show abstract

“…Over the last two decades, there has been a steady increase in the use of type systems to capture program properties such as control flow [15], memory management [22], aliasing [20], data structure invariants [11,7,28] and effects [21,14], to mention just a few. Ideally, such type systems specify rigorously, yet at a high level of abstraction, how to reason about a certain class of program properties.…”

Section: Introductionmentioning

confidence: 99%

Tridirectional typechecking

Dunfield

Pfenning

2004

SIGPLAN Not.

View full text Add to dashboard Cite

In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantified dependent types. This system was shown sound with respect to a call-by-value operational semantics with effects, yet is inherently undecidable.In this paper we provide a decidable formulation for this system based on bidirectional checking, combining type synthesis and analysis following logical principles. The presence of unions and existential quantification requires the additional ability to visit subterms in evaluation position before the context in which they occur, leading to a tridirectional type system. While soundness with respect to the type assignment system is immediate, completeness requires the novel concept of contextual type annotations, introducing a notion from the study of principal typings into the source program.

show abstract

From polyvariant flow information to intersection and union types

Cited by 42 publications

References 55 publications

Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close

Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close

Precise Constraint-Based Type Inference for Java

Tridirectional typechecking

Contact Info

Product

Resources

About