Compiling standard ML to Java bytecodes

DOI10.1145/289423.289435zbMath1428.68096OpenAlexW2022949157WikidataQ131113792 ScholiaQ131113792MaRDI QIDQ5234263

George T. Russell, Nick Benton, Andrew J. Kennedy

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.289435

Mathematics Subject Classification ID

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

Related Items (6)

Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics ⋮ ANF preserves dependent types up to extensional equality ⋮ OCaml-Java: The Java Virtual Machine as the target of an OCaml compiler ⋮ No value restriction is needed for algebraic effects and handlers ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ A portable approach to dynamic optimization in run-time specialization

This page was built for publication: Compiling standard ML to Java bytecodes