A calculus with polymorphic and polyvariant flow types

Wells, J. B.; Dimock, Allyn; Muller, Robert; Turbak, Franklyn

doi:10.1017/s0956796801004245

Cited by 44 publications

(29 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some work on program analysis in compilation uses intersection and union types to infer control flow properties [24,15]. Because of the goals of these systems for program analysis and control flow information, the specific forms of intersection and union types are quite different from ours.…”

Section: Related Workmentioning

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

Section: Related Workmentioning

confidence: 99%

Tridirectional typechecking

Dunfield

Pfenning

2004

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Wells et al [169] have investigated a type-based intermediate language with intersection and union flow types. Their focus has been type-based compilation, rather than flow analysis [169].…”

Section: Type-based Analysismentioning

confidence: 99%

“…Their focus has been type-based compilation, rather than flow analysis [169]. As such, they have inferred control-flow information using known flow analyses, and afterwards decorated the flow types with the inferred flow information [48].…”

Section: Type-based Analysismentioning

confidence: 99%

See 1 more Smart Citation

Control-flow analysis of functional programs

Midtgaard

2012

ACM Comput. Surv.

View full text Add to dashboard Cite

We present a survey of control-flow analysis of functional programs, which has been the subject of extensive investigation throughout the past 25 years. Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft. In this paper we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them. * IT-parken,

show abstract

“…Reasoning directly over diverging executions in a step-indexed approach is difficult, because we lack the notion of "number of execution steps" to build inductive definitions and Uncurrying of functions, including across higher-order functions, could also be decided based on the results of Shivers' control-flow analysis [32] or its type-based reformulation by Wells et al [37]. Conservatively, one could uncurry a function definition only if all the call sites to which it flows are curried and match the arity of the function; in this case, no coercions need to be inserted.…”

Section: 1mentioning

confidence: 99%

A verified framework for higher-order uncurrying optimizations

Dargaye

Leroy²

2009

Higher-Order Symb Comput

View full text Add to dashboard Cite

Function uncurrying is an important optimization for the efficient execution of functional programming languages. This optimization replaces curried functions by uncurried, multiple-argument functions, while preserving the ability to evaluate partial applications. First-order uncurrying (where curried functions are optimized only in the static scopes of their definitions) is well understood and implemented by many compilers, but its extension to higher-order functions (where uncurrying can also be performed on parameters and results of higher-order functions) is challenging. This article develops a generic framework that expresses higher-order uncurrying optimizations as type-directed insertion of coercions, and prove its correctness. The proof uses step-indexed logical relations and was entirely mechanized using the Coq proof assistant.

show abstract

A calculus with polymorphic and polyvariant flow types

Cited by 44 publications

References 61 publications

Tridirectional typechecking

Tridirectional typechecking

Control-flow analysis of functional programs

A verified framework for higher-order uncurrying optimizations

Contact Info

Product

Resources

About