Recursion and dynamic data-structures in bounded space: towards embedded ML programming

DOI10.1145/317636.317785MaRDI QIDQ2817712zbMATH OpenOpenAlexFDO

Authors John Hughes, Lars Pareto

Publication date 1 September 2016

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

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Data structures (68P05)

Recommendations

• A type system for bounded space and functional in-place update. (Extended abstract)
• Space-Efficient Computation by Interaction
• A type system for bounded space and functional in-place update
• Static prediction of heap space usage for first-order functional programs
• Computation by interaction for space-bounded functional programming

Cited in

(13)

• A type system for counting instances of software components
• Distributed call-tracking for security
• Type-based cost analysis for lazy functional languages
• A type system for bounded space and functional in-place update
• A Coq library for internal verification of running-times
• Calculating statically maximum log memory used by multi-threaded transactional programs
• Efficient Type-Checking for Amortised Heap-Space Analysis
• A type system for bounded space and functional in-place update. (Extended abstract)
• Termination checking with types
• A transformational approach to resource analysis with typed-norms inference
• In-place graph rewriting with interaction nets
• Semantic foundations for cost analysis of pipeline-optimized programs
• Syntactic control of concurrency

This page was built for publication: Recursion and dynamic data-structures in bounded space: towards embedded ML programming

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