A New Translation Algorithm from Lambda Calculus into Combinatory Logic

• Type: Article in International Conference Proceedings Book
• Date: 1995

Authors

Sabine Broda (Author) FCUP; Luís Damas (Author) FCUP

Conference proceedings International

Title: Progress in Artificial Intelligence, 7th Portuguese Conference on Artificial Intelligence, EPIA '95, Funchal, Madeira Island, Portugal, October 3-6, 1995, Proceedings

Pages: 359-370

Indexing

ISI Web of Knowledge

Scopus - 0 Citations

Other information

Authenticus ID: P-008-WVX

DOI: 10.1007/3-540-60428-6_30

Abstract (EN): Systems of lambda calculus are of importance for most knowledge representation theories and in particular for several systems for Natural Language Processing. During the implementation of lambda systems several problems arise that are directly related to the presence of bound variables. These problems can be avoided using translations from lambda calculus into combinatory systems, which give origin to extremely simple reduction machines. In this article we present and prove the correctness of a translation algorithm, that., when compared with other systems, has quite good properties in terms of memory space as well as in terms of length of evaluations. © Springer-Verlag Berlin Heidelberg 1995.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12