A new program for combinatory reduction and abstraction
dc.contributor.author | Deshpande, Sushant | |
dc.contributor.author | University of Lethbridge. Faculty of Arts and Science | |
dc.contributor.supervisor | Seldin, Jonathan | |
dc.date.accessioned | 2011-06-15T17:45:08Z | |
dc.date.available | 2011-06-15T17:45:08Z | |
dc.date.issued | 2009 | |
dc.degree.level | Masters | |
dc.description | v, 96 leaves ; 29 cm | en_US |
dc.description.abstract | Even though lambda calculus (λ-calculus) and combinatory logic (CL) appear to be equivalent, they are not. As yet we do not have a reduction in CL which corresponds to β-reduction in λ-calculus. There are three proposals but they all have few problems one of which is the lack of a complete characterization of CL-terms corresponding to λ-terms in β-normal form. Finding such a characterization for any of the three proposals appears to require a lot of examples which are tedious and time consuming to develop by hand. For this reason, a computer program to do reductions and abstractions of CL-terms would be useful. This thesis is about an attempt to write such a program. The program that we have does not yet work for the three proposals but it works for βη-strong reduction. Coding this program turned out to be much harder than anticipated. Dr. Robin Cockett developed a semantic translation which helped in coding the program but his semantic translation needs to be extended to all three proposals to obtain the program originally desired and that needs a lot of research. | en_US |
dc.identifier.uri | https://hdl.handle.net/10133/1296 | |
dc.language.iso | en_US | en_US |
dc.publisher | Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2009 | en_US |
dc.publisher.department | Department of Mathematics and Computer Science | en_US |
dc.publisher.faculty | Arts and Science | en_US |
dc.relation.ispartofseries | Thesis (University of Lethbridge. Faculty of Arts and Science) | en_US |
dc.subject | Combinatory logic | en_US |
dc.subject | Lambda calculus | en_US |
dc.subject | Dissertations, Academic | en_US |
dc.title | A new program for combinatory reduction and abstraction | en_US |
dc.type | Thesis | en_US |