Skip Navigation

Logic Journal of IGPL 2005 13(5):515-524; doi:10.1093/jigpal/jzi039
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dostál, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2005. Published by Oxford University Press. All rights reserved.

Original Articles

On Evolving of Recursive Functions using {lambda}-abstraction and Higher-order Functions

Martin Dostál

Dept. Computer Science, Palacky University Olomouc, Czech Republic. E-mail: dostal{at}inf.upol.cz

This article introduces an application of higher order functions as structure abstractions of recursive1 functions as a method to reduce a search effort needed for the automatic programming (evolving) of common types of recursive functions. We will shortly describe a functional paradigm based language specially designed for automatic programming. Henceforward we introduce the structure abstraction functions (AR-functions) and the results of experiments.

Key Words: automatic programming, lambda calculus, higher-order functions



Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.