Optimality and inefficiency
From MaRDI portal
Publication:2817687
DOI10.1145/232627.232639zbMath1345.68063OpenAlexW2015890451MaRDI QIDQ2817687
Julia L. Lawall, Harry G. Mairson
Publication date: 1 September 2016
Published in: Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/232627.232639
Related Items (15)
(Optimal) duplication is not elementary recursive ⋮ Coherence for sharing proof nets ⋮ On the dynamics of sharing graphs ⋮ Coherence for sharing proof-nets ⋮ Light logics and optimal reduction: completeness and complexity ⋮ Unnamed Item ⋮ The weak lambda calculus as a reasonable machine ⋮ Lambda-calculus with director strings ⋮ Unnamed Item ⋮ A note on complexity measures for inductive classes in constructive type theory ⋮ Automated higher-order complexity analysis ⋮ (In)efficiency and reasonable cost models ⋮ Proof nets, garbage, and computations ⋮ Parallel beta reduction is not elementary recursive ⋮ Complete Laziness: a Natural Semantics
This page was built for publication: Optimality and inefficiency
