Document Open Access Logo

ML with PTIME complexity guarantees

Authors Jacek Chrzaszcz, Aleksy Schubert



PDF
Thumbnail PDF

File

LIPIcs.CSL.2012.198.pdf
  • Filesize: 0.59 MB
  • 15 pages

Document Identifiers

Author Details

Jacek Chrzaszcz
Aleksy Schubert

Cite AsGet BibTex

Jacek Chrzaszcz and Aleksy Schubert. ML with PTIME complexity guarantees. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 198-212, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.CSL.2012.198

Abstract

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.
Keywords
  • implicit computational complexity
  • polymorphism
  • soft type assignment

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail