Gödel's system T revisited

Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie
2010 Theoretical Computer Science  
The linear lambda calculus, where variables are restricted to occur in terms exactly once, has a very weak expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension with natural numbers and a restricted iterator: only closed linear functions can be iterated. We show properties of this linear version of Gödel's T using a closed reduction strategy, and study the class of functions that can be represented. Surprisingly, this linear
more » ... s offers a huge increase in expressive power over previous linear versions of T , which are 'closed at construction' rather than 'closed at reduction'. We show that a linear T with closed reduction is as powerful as T .
doi:10.1016/j.tcs.2009.11.014 fatcat:of7xz4qeezf45bkiosv3xisibq