Generating lambda term individuals in typed genetic programming using forgetful A*

Křen, Tomáš; Neruda, Roman

doi:10.1109/cec.2014.6900547

Search citation statements

Order By: Relevance

Paper Sections

Select...

Grammar Producing λ-Terms In Lnf1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2023

Publication Types

Select...

Other4

Relationship

Self Cite1

Independent3

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Standard ramped half-and-half strategy can be used for this purpose, or some other, which we discuss in [7]. In our experiments we use the geometric strategy proposed in [7].…”

Section: Grammar Producing λ-Terms In Lnfmentioning

confidence: 99%

Utilization of reductions and abstraction elimination in typed genetic programming

Křen

Neruda

2014

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation

Self Cite

View full text Add to dashboard Cite

Lambda calculus representation of programs offers a more expressive alternative to traditional S-expressions. In this paper we discuss advantages of this representation coming from the use of reductions (beta and eta) and a way to overcome disadvantages caused by variables occurring in the programs by use of the abstraction elimination algorithm. We discuss the role of those reductions in the process of generating initial population and propose two novel crossover operations based on abstraction elimination capable of handling general form of typed lambda term while being a straight generalization of the standard crossover operation. We compare their performances using the even parity benchmark problem.

show abstract

“…Standard ramped half-and-half strategy can be used for this purpose, or some other, which we discuss in [7]. In our experiments we use the geometric strategy proposed in [7].…”

Section: Grammar Producing λ-Terms In Lnfmentioning

confidence: 99%