Self-Replicating Expressions in the Lambda Calculus

The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles and algorithms involved in self-replication. The bulk of the literature explores self-replicating forms in Cellular Automata. Though trivially self-replicating programs have been written for dozens of languages, very little work exists that explores self-replicating forms in programming languages. This paper reports initial investigations into selfreplicating expressions in the Lambda Calculus, the basis for functional programming languages. Mimicking results from the work on Cellular Automata, selfreplicating Lambda Calculus expressions that also allow the application of an arbitrary program to arbitrary data are presented. Standard normal order reduction, however, will not reduce the sub-expression representing the program application. Two approaches of dealing with this, hybrid reduction and parallel reduct...

• Type: Conference
• Year: 2004
• Where: ACSC
• Authors: James Larkin, Phil Stocks
• Keywords: ACSC 2004, Cellular Automata, Explores Self-replicating Forms, Self-replicating, Theoretical Computer Science