A modular, polyvariant and type-based closure analysis

DOI10.1145/258948.258951zbMath1369.68086OpenAlexW1976808561MaRDI QIDQ5348860

Anindya Banerjee

Publication date: 21 August 2017

Published in: Proceedings of the second ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/258948.258951

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (4)

ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs ⋮ Principality and type inference for intersection types using expansion variables ⋮ Abstract allocation as a unified approach to polyvariance in control-flow analyses ⋮ Rough convergence of sequences in a cone metric space

This page was built for publication: A modular, polyvariant and type-based closure analysis