Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
Abstract elided by the publisher.
Related papers
- Automatic amortised analysis of dynamic memory allocation for lazy functional programs ICFP 2012
- Contract-based resource verification for higher-order functions with memoization POPL 2017
- Packrat parsing: : simple, powerful, lazy, linear time, functional pearl ICFP 2002
- A Type-based Analysis for Stack Allocation in Functional Languages SAS 1995
- Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions POPL 1994
- Partially Strict Non-Recursive Data Types JFP 1993
- Pointer analysis for structured parallel programs TOPLAS 2003
- Parallel Functional Programming on Recursively Defined Data via Data-Parallel Recursion JFP 1999