An encoding scheme for generating λ-expressions in genetic programming

  • Authors:

  • Kazuto Tominaga;Tomoya Suzuki;Kazuhiro Oka

  • Affiliations:

  • Tokyo University of Technology, Hachioji, Tokyo, Japan;Tokyo University of Technology, Hachioji, Tokyo, Japan;Tokyo University of Technology, Hachioji, Tokyo, Japan

  • Venue:
  • GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

To apply genetic programming (GP) to evolve λ-expressions, we devised an encoding scheme that encodes λ-expressions into trees. This encoding has closure property, i.e., any combination of terminal and non-terminal symbols forms a valid λ-expression. We applied this encoding to a simple symbolic regression problem over Church numerals and the objective function f(x) = 2x was successfully obtained. This encoding scheme will provide a good foothold for exploring fundamental properties of GP by making use of lambda-calculus.