Skip to main content
SpringerLink
Log in
Book cover

Pacific Rim International Conference on Artificial Intelligence

PRICAI 2004: PRICAI 2004: Trends in Artificial Intelligence pp 75–84Cite as

Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3157))

Abstract

A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the information of the type and the property that should be satisfied, this algorithm is able to find automatically the shortest Haskell program using the set of function components (or library) configured beforehand, and there is no need to design the library every time one requests a new functional program.

According to the presented experiments, programs consisted of several function applications can be found within some seconds even if we always use the library designed for general use. In addition, the proposed algorithm can efficiently tell the number of possible functions of given size that are consistent with the given type, and thus can be a tool to evaluate other methods like genetic programming by providing the information of the baseline performance.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Augusteijn, L.: Sorting Morphisms. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol. 1608, pp. 1–27. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Field, A.J., Harrison, P.G.: Functional Programming. Addison-Wesley, Reading (1988)

    MATH  Google Scholar 

  3. Hudak, P., Fasel, J.H.: A gentle introduction to Haskell. SIGPLAN Notices 27(5), T1–T53 (1992)

    Google Scholar 

  4. Jones, M.P.: Typing Haskell in Haskell. In: Proc. of the 1999 Haskell Workshop (1999)

    Google Scholar 

  5. Katayama, S.: Implementing a breadth-first search algorithm for strongly typed inductive functional programming. In: The 2004 International Conference on Functional Programming (2004) (submitted to)

    Google Scholar 

  6. Olsson, R.: Inductive Functional Programming Using Incremental Program Transformation. Research report 189, Doctor scientiarum thesis, University of Oslo (1994)

    Google Scholar 

  7. Spivey, M.: Combinators for breadth-first search. J. Functional Programming 10(4), 397–408 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Yu, T.: Polymorphism and genetic programming. In: Proc. of Fourth European Conference on Genetic Programming (2001)

    Google Scholar 

  9. Yu, T., Clack, C.: PolyGP: A polymorphic genetic programming system in Haskell. In: Genetic Programming 1998: Proc. of the Third Annual Conference, pp. 416–421 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Miyazaki, Miyazaki, 889-2155, Japan

    Susumu Katayama

Authors
  1. Susumu Katayama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Information Technology, Centre for Quantum Computation and Intelligent Systems, and Australian ACS National Committee for Artificial Intelligence, University of Technology, Sydney, Australia

    Chengqi Zhang

  2. Department of Computer Science, Auckland University of Technology, 1020, Auckland, New Zealand

    Hans W. Guesgen

  3. Artificial Intelligence Technology Centre, Auckland University of Technology, Auckland, New Zealand

    Wai-Kiang Yeap

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katayama, S. (2004). Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28633-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22817-2

  • Online ISBN: 978-3-540-28633-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation