Andy Melnikov (nponeccop) wrote,
Andy Melnikov

Pola: a language for PTIME programming

This paper describes the type system of a functional style
programming language called Pola which is complete with respect to
polynomial time programming. This means, both that every well-typed
Pola program is guaranteed to halt in time polynomial with respect to
the size of its input, and that all such polynomial time functions can be
written in Pola.

UPDATE: Но и это ещё не всё - ...there is a full type inference algorithm
for Pola programs! И они были далеко не первыми - читайте их библиографию
Tags: compiler design, fp, programming

  • Post a new comment


    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.