A calculus with polymorphic and polyvariant flow types

DOI10.1017/S0956796801004245MaRDI QIDQ4542147zbMATH OpenOpenAlexFDO

Authors J. B. Wells, Allyn Dimock, Robert Müller, Franklyn Turbak

Publication date 6 October 2002

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

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

zbMATH Keywords

\(\lambda\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20)

Recommendations

• Polyvariant flow analysis with constrained types
• Flow-sensitive type systems and the ambient calculus
• A sequent calculus for subtyping polymorphic types
• A sequent calculus for subtyping polymorphic types
• Types and full abstraction for polyadic -calculus
• scientific article; zbMATH DE number 4148057
• Faithful translations between polyvariant flows and polymorphic types
• A type system for continuation calculus
• Rewriting calculus with(out) types
• A polymorphic environment calculus and its type-inference algorithm

Cited in

(18)

• Flow-sensitive type systems and the ambient calculus
• Intersection-types à la Church
• From polyvariant flow information to intersection and union types
• Intersection typed -calculus
• Quantitative Information Flow, Relations and Polymorphic Types
• A realizability interpretation for intersection and union types
• A type system for a lambda calculus with assignments
• Faithful translations between polyvariant flows and polymorphic types
• Program representation size in an intermediate language with intersection and union types
• ConSORT: context- and flow-sensitive ownership refinement types for imperative programs
• The -calculus: syntax and types
• Type-Based Productivity of Stream Definitions in the Calculus of Constructions
• Programming Languages and Systems
• Strongly typed flow-directed representation transformations (extended abstract)
• Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
• Intersection types via finite-set declarations
• Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
• A verified framework for higher-order uncurrying optimizations

Describes a project that uses

Uses Software

• GHC

This page was built for publication: A calculus with polymorphic and polyvariant flow types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542147)