Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages

DOI10.1007/978-3-662-46669-8_32zbMATH1335.68035OpenAlexW2294370068MaRDI QIDQ2802465FDOQ2802465

Authors Pedro Vasconcelos, Steffen Jost, Mário Florido, Kevin Hammond

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10023/8612

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Type-based cost analysis for lazy functional languages
• Adequacy for a lazy functional language with recursive and polymorphic types
• Efficient intensional implementation for lazy functional languages
• Typing total recursive functions in Coq
• Usage counting analysis for lazy functional languages
• A type-based escape analysis for functional languages
• scientific article; zbMATH DE number 675533
• The dynamic compilation of lazy functional programs

Cited in

(7)

• scientific article; zbMATH DE number 7204445 (Why is no real title available?)
• Two decades of automatic amortized resource analysis
• A type-based escape analysis for functional languages
• Type-based cost analysis for lazy functional languages
• Quantum weakest preconditions for reasoning about expected runtimes of quantum programs
• Exponential automatic amortized resource analysis
• Automatic amortised analysis of dynamic memory allocation for lazy functional programs

This page was built for publication: Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages

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