On the runtime complexity of type-directed unboxing

DOI10.1145/289423.289424MaRDI QIDQ5348883zbMATH OpenOpenAlexFDO

Authors Yasuhiko Minamide, Jacques Garrigue

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

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

Recommendations

• On the runtime complexity of type-directed unboxing
• Compiler Construction
• Flexible representation analysis
• Type-directed specialization of polymorphism.
• Flexible type analysis

Cited in

(6)

• Flattening tuples in an SSA intermediate representation
• A new criterion for safe program transformations
• Selective Memoization with Box Types
• On the runtime complexity of type-directed unboxing
• Compiler Construction
• Space-efficient gradual typing

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

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