Godel's system T revisited

• Type: Article in International Scientific Journal
• Date: 2010

Authors

Sandra Alves (Author) FCUP; Maribel Fernandez (Author) Other; Mario Florido (Author) FCUP; Ian Mackie (Author) Other

Journal

Title: Theoretical Computer Science

Vol. 411 No. 11-13

Pages: 1484-1500

ISSN: 0304-3975

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 11 Citations

Scopus - 16 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-8BA

DOI: 10.1016/j.tcs.2009.11.014

Abstract (EN): 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 Godel's T using a closed reduction strategy, and study the class of functions that can be represented. Surprisingly, this linear calculus 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 17