Logic Column 9 C o l u m n Editor: J o n G. Riecke Bell Laboratories, Lucent Technologies 700 M o u n t a i n A v e n u e M u r r a y Hill, N J 07974 riecke@bell-labs, tom Programming languages capturing complexity classes* Martin Hofmann L a b o r a t o r y for F o u n d a t i o n s of C o m p u t e r Science University of E d i n b u r g h (mxh@dcs.ed.ac.uk) F e b r u a r y 3, 2000 1 Introduction In recent years there has been a growing interest in programming languages with the property that all definable functions belong to some complexity class, often polynomial time or space. This research has established a link between computational complexity theory and the fields of type systems and programming language semantics with emerging applications to resource certification and programming under resource restrictions as arise in embedded systems. The purpose of this article is to survey this development beginning from Cobham's 1965 result which was the first in the area, up to
/lp/association-for-computing-machinery/programming-languages-capturing-complexity-classes-TbUPMcQqEM