2026-07-20T05:11:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3673 2024-03-06T10:34:21Z ddc:004 open_access

ML with PTIME complexity guarantees Chrzaszcz, Jacek Schubert, Aleksy implicit computational complexity polymorphism soft type assignment Implicit Computational Complexity is a line of research where the possibility to inference a valid property for a program implies that the program runs in particular complexity class. Soft type systems are one of the research threads within the field. We present here a soft type system with ML-like polymorphism that enjoys decidable typechecking, type inference and typability problems and gives polynomial time computational guarantees for the running time of typed programs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jacek Chrzaszcz and Aleksy Schubert 2012 Is Part Of LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2012.198 urn:nbn:de:0030-drops-36738 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.198 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode