2018-11-16: Bob Atkey (MSP)

Sat, 21 Oct 2023 21:24:08 +0100

Bob Atkey (MSP)

MSP 101: Polynomial time programming languages

Abstract

Implicit Computational Complexity is the study of programming languages or logical systems that capture complexity classes. Roughly, every program that can be written in the language is in some complexity class. Many of the languages that have been proposed for capturing useful classes like PTIME are not much fun to program in. However, the work of the late Martin Hofmann included work on languages like LFPL, which only allows polynomial time computation, but is also reasonably usable. I'll talk about LFPL, and how the proof of polynomial time bounds works.

2018-11-16 16:15:00 UTC
LT1310