Recursion and dynamic data-structures in bounded space
From MaRDI portal
Publication:2817712
DOI10.1145/317636.317785zbMath1345.68061OpenAlexW2055814018MaRDI QIDQ2817712
No author found.
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
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Data structures (68P05)
Related Items (11)
Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs ⋮ Type-based cost analysis for lazy functional languages ⋮ Semantic foundations for cost analysis of pipeline-optimized programs ⋮ Unnamed Item ⋮ A type system for counting instances of software components ⋮ Termination checking with types ⋮ A Coq Library for Internal Verification of Running-Times ⋮ A Transformational Approach to Resource Analysis with Typed-norms Inference ⋮ Efficient Type-Checking for Amortised Heap-Space Analysis ⋮ Distributed call-tracking for security ⋮ Syntactic control of concurrency
This page was built for publication: Recursion and dynamic data-structures in bounded space
