Genetic programming with polymorphic types and higher-order functions

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 1187-1194

  Binard, Franck ^a   Felty, Amy ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Genetic programming; Lambda calculus; Polymorphism; Types

Indexed keywords

ABSTRACTING; CALCULATIONS; DIFFERENTIATION (CALCULUS); GENETIC ALGORITHMS; POLYMORPHISM;

COMPUTATIONAL STRUCTURE; HIGHER ORDER FUNCTIONS; LAMBDA CALCULUS; POLYMORPHIC TYPES; PROGRAM REPRESENTATIONS; PROGRAMMING STRUCTURES; REPRESENTATION SCHEMES; TYPES;

GENETIC PROGRAMMING;

EID: 57349156182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389330     Document Type: Conference Paper

References (16)

1. H. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Volumes 1 (Background: Mathematical Structures) and 2 (Background: Computational Structures), Abramsky & Gabbay & Maibaum (Eds.), Clarendon. Oxford University Press, 1992.
2. F. Binard and A. Felty. An abstraction-based genetic programming system. In P. A. N. Bosman, editor, Late breaking paper at Genetic and Evolutionary Computation Conference (GECCO'2007), pages 2415-2422, London, United Kingdom, 7-11 July 2007. ACM Press.
3. S. Brave. Using genetic programming to evolve recursive programs for tree search. In Proceedings of the Fourth Golden West Conference on intelligent Systems, pages 60-65, NC, 1995. International Society for Computers and Their Applications, Raleigh.
4. C. Clack and T. Yu. Performance enhanced genetic programming. In P. J. Angeline, R. G. Reynolds, J. R. McDonnell, and R. Eberhart, editors, Evolutionary Programming VI, pages 87-100, Berlin, 1997. Springer.
5. J. Girard. Une extension de l'interprétation de gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types. In J. Fenstadt, editor, Proc. 2nd Scandinavian Logic Symp., pages 63-92, Amsterdam, 1971. North-Holland.
6. J. Girard et al. Proofs and types. Cambridge University Press New York, 1989.
7. T. Haynes, R. Wainwright, S. Sen, and D. Schoenefeld. Strongly typed genetic programming in evolving cooperation strategies. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 271-278, Pittsburgh, PA, USA, 15-19 1995. Morgan Kaufmann.
8. W. A. Howard. The formulae-as-type notion of construction, 1969. In To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pages 479-490. Academic Press, 1980.
9. L. J.Y. Girard and Taylor. Proofs and Types. Cambridge University Press., 1997.
10. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
11. J. R. Koza. The genetic programming paradigm: Genetically breeding populations of computer programs to solve problems. In B. Soucek and the IRIS Group, editors, Dynamic, Genetic, and Chaotic Programming, pages 203-321. John Wiley, New York, 1992.
12. J. R. Koza. Genetic programming version 2. Submitted for inclusion in the Encyclopaedia of Computer Science and Technology, 1997.
13. D. Montana. Strongly Typed Genetic Programming. Evolutionary Computation, 3:199-230, 1995.
14. J. C. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation, volume 19 of LNCS, pages 408-425. Springer-Verlag, 1974.
15. A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230-265, 1936.
16. T. Yu and C. Clack. Recursion, lambda abstractions and genetic programming. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 422-431, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.