Analysing the complexity of functional programs: higher-order meets first-order

DOI10.1145/2784731.2784753zbMath1360.68313arXiv1506.05043OpenAlexW2020692742MaRDI QIDQ2981952

Martin Avanzini, Ugo Dal Lago, Georg Moser

Publication date: 10 May 2017

Published in: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.05043

zbMATH Keywords

terminationterm rewritingresource analysisdefunctionalisation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (12)

Higher-order interpretations and program complexity ⋮ Unnamed Item ⋮ ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ On the enumeration of closures and environments with an application to random generation ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mechanisation of the AKS algorithm ⋮ Unnamed Item ⋮ Type-based analysis of logarithmic amortised complexity ⋮ Runtime complexity analysis of logically constrained rewriting

This page was built for publication: Analysing the complexity of functional programs: higher-order meets first-order