On the runtime complexity of type-directed unboxing

DOI10.1145/289423.289424zbMath1369.68111OpenAlexW2083784549MaRDI QIDQ5348883

Jacques Garrigue, Yasuhiko Minamide

Publication date: 21 August 2017

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18)

Related Items (3)

Space-efficient gradual typing ⋮ A New Criterion for Safe Program Transformations ⋮ Flattening tuples in an SSA intermediate representation

This page was built for publication: On the runtime complexity of type-directed unboxing