On the runtime complexity of type-directed unboxing
From MaRDI portal
Publication:5234255
DOI10.1145/289423.289424zbMath1428.68108OpenAlexW2083784549MaRDI QIDQ5234255
Yasuhiko Minamide, Jacques Garrigue
Publication date: 26 September 2019
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
Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18)
This page was built for publication: On the runtime complexity of type-directed unboxing