From Polyvariant flow information to intersection and union types

DOI10.1017/S095679680100394XzbMath0976.68024OpenAlexW2136290535MaRDI QIDQ2732171

Christina Pavlopoulou, Jens Palsberg

Publication date: 23 July 2001

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s095679680100394x

zbMATH Keywords

polyvariant flow analysespolyvariant program

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (7)

Type systems equivalent to data-flow analyses for imperative languages ⋮ Type inference for rank-2 intersection types using set unification ⋮ Structural rules and algebraic properties of intersection types ⋮ Abstract allocation as a unified approach to polyvariance in control-flow analyses ⋮ Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage ⋮ From flow logic to static type systems for coordination languages ⋮ Efficient and flexible matching of recursive types

This page was built for publication: From Polyvariant flow information to intersection and union types