PolyGP: A polymorphic genetic programming system in haskell. In general, the machine learning process can be accelerated through the use of additional knowledge about the problem solution. For example, monomorphic typed Genetic Programming (GP) uses type information to reduce the search space and improve performance. Unfortunately, monomorphic typed GP also loses the generality of untyped GP: the generated programs are only suitable for inputs with the specified type. Polymorphic typed GP improves over monomorphic and untyped GP by allowing the type information to be expressed in a more generic manner, and yet still imposes constraints on the search space. This paper describes a polymorphic GP system which can generate polymorphic programs: programs which take inputs of more than one type and produce outputs of more than one type

References in zbMATH (referenced in 4 articles )

Showing results 1 to 4 of 4.
Sorted by year (citations)

  1. Murphy, Gearoid; Ryan, Conor: Manipulation of convergence in evolutionary systems (2008)
  2. Wong, Man Leung; Mun, Tuen: Evolving recursive programs by using adaptive grammar based genetic programming (2005) ioport
  3. Keijzer, Maarten; Babovic, Vladan: Declarative and preferential bias in GP-based scientific discovery (2002)
  4. Yu, Tina: Hierarchical processing for evolving recursive and modular programs using higher-order functions and lambda abstraction (2001)