Paper Info
Title
A New Translation Algorithm from Lambda Calculus into Combinatory Logic
Abstract
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.
Year
DOI
Venue
1995
10.1007/3-540-60428-6_30
EPIA '89
Keywords
Field
DocType
lambda calculus,knowledge representation,combinatory logic,new translation algorithm,natural language processing
Deductive lambda calculus,Simply typed lambda calculus,Typed lambda calculus,Computer science,System F,Algorithm,Church encoding,Lambda lifting,Pure type system,Curry–Howard correspondence
Conference
ISBN
Citations 
PageRank 
3-540-60428-6
1
0.37
References 
Authors
8
2
Name
Order
Citations
PageRank
Sabine Broda16413.83
Luís Damas212822.34