Pola
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
| Designed by | Michael J. Burrell, Robin Cockett, & Brian F. Redmond |
|---|---|
| Appeared in | 2009 |
| Computational class | PTIME |
| Reference implementation | Unimplemented |
Pola is a language introduced to clarify the nature of polynomial-time computation. In Pola, every computation is a polynomial-time function.[1]
See also
- Cammy, another functional language with a naturally-restricted complexity class
References
- ↑ M. J. Burrell, R. Cockett, B. F. Redmond, 2009. Pola: a language for PTIME programming. 6th Workshop on Fixed Points in Computer Science (FICS 2009). https://cs.ioc.ee/fics09/proceedings/ https://www.researchgate.net/publication/266217730_Pola_a_language_for_PTIME_programming