
Young Researcher and Innovator Conference Grant
Berfin Sakallioglu, University of Trieste, Trieste, Italy
Giorgia Nadizar, University of Trieste, Trieste, Italy
Luca Manzoni, University of Trieste, Trieste, Italy
Eric Medvet, University of Trieste, Trieste, Italy
The Genetic and Evolutionary Computation Conference (GECCO 2025)
Malaga, Spain
14-18 July 2025
Grantee: Berfin Sakallioglu, University of Trieste, Trieste, Italy
Type of publication: Workshop paper
Type of presentation: Oral
Start date: 2025-07-14
End date: 2025-07-19
Awarded: 2025-05-13
Report approved: 2025-08-19

We propose a novel, type-consistent representation for programs manipulating arbitrary data types, that we call typed token processing networks (TTPNs). A TTPN is a network of interconnected stateless gates defining typed ports and processing functions: during the execution, data flows through the network as typed tokens carrying values. TTPNs favor interpretability as they can visually reveal the overall structure of a program and also highlight the way data is processed at runtime—enabling decomposability and simulatability, respectively. Moreover, like other graph representations, TTPNs enable component reuse. We evolve programs in the form of TTPNs from examples, i.e., we do program synthesis, with a simple genetic algorithm and ad hoc genetic operators. Our preliminary results show successful evolution of simple programs from small example sets involving diverse types, though some in- stances fail. We hypothesize that the particularly rugged fitness landscape imposed by our representation and, more in general, by the program synthesis scenario, may hinder convergence. We propose some directions for tackling these issues.