(Optimal) duplication is not elementary recursive

DOI10.1145/325694.325707zbMath1323.68091OpenAlexW2103362760MaRDI QIDQ5178845

Paolo Coppola, Simone Martini, Andrea Asperti

Publication date: 17 March 2015

Published in: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/325694.325707

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Phase semantics and decidability of elementary affine logic ⋮ Coherence for sharing proof-nets ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ (In)efficiency and reasonable cost models

This page was built for publication: (Optimal) duplication is not elementary recursive