ML with PTIME complexity guarantees

DOI10.4230/LIPIcs.CSL.2012.198zbMath1252.68063OpenAlexW2247960266MaRDI QIDQ4649547

Aleksy Schubert, Jacek Chrząszcz

Publication date: 22 November 2012

Full work available at URL: http://www.frontiersinai.com/turingfiles/September/19.pdf

zbMATH Keywords

polymorphismimplicit computational complexitysoft type assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization

This page was built for publication: ML with PTIME complexity guarantees