Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

DOI10.1007/978-3-662-44602-7_13zbMath1417.68047OpenAlexW197485084MaRDI QIDQ3190158

Patrick Baillot, Erika De Benedetti, Simonetta Ronchi della Rocca

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44602-7_13

zbMATH Keywords

linear logiclambda-calculusimplicit computational complexity

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item

This page was built for publication: Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus