Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approaches and Applications of Inductive Programming

AAIP 2009: Approaches and Applications of Inductive Programming pp 174–193Cite as

Recent Improvements of MagicHaskeller

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 5812))

Abstract

MagicHaskeller is our inductive functional programming library based on systematic search. In this paper we introduce two recent improvements to MagicHaskeller, i.e. 1) clarification and extension to arbitrary-rank polymorphism of its algorithm, and 2) efficiency improvement in its filtration algorithm that removes redundancy in the search results.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: ICFP 2000: Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming, pp. 268–279. ACM, New York (2000)

    Chapter  Google Scholar 

  2. Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic 57, 795–807 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Herbelin, H.: A lambda-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 61–75. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  4. Hofmann, M., Kitzelmann, E., Schmid, U.: A unifying framework for analysis and evaluation of inductive programming systems. In: Proceedings of the Second Conference on Artificial General Intelligence (2009)

    Google Scholar 

  5. Hudelmaier, J.: Bounds on cut-elimination in intuitionistic propositional logic. Archive for Mathematical Logic 31, 331–354 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Katayama, S.: Library for systematic search for expressions and its efficiency evaluation. WSEAS Transactions on Computers 12(5), 3146–3153 (2006)

    Google Scholar 

  7. Katayama, S.: Systematic search for lambda expressions. In: Sixth Symposium on Trends in Functional Programming, pp. 195–205 (2005)

    Google Scholar 

  8. Katayama, S.: Efficient exhaustive generation of functional programs using monte-carlo search with iterative deepening. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 199–210. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Katayama, S.: MagicHaskeller (2005b), http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.html

  10. Katayama, S.: Systematic search for lambda expressions. In: Trends in Functional Programming, vol. 6, pp. 111–126, Intellect (2007)

    Google Scholar 

  11. Kiselyov, O.: Reversing haskell typechecker: converting from undefined to defined (2005), http://okmij.org/ftp/Haskell/types.html#de-typechecker

  12. Kitzelmann, E.: Data-driven induction of recursive functions from input/output-examples. In: AAIP 2007: Proceedings of the Workshop on Approaches and Applications of Inductive Programming, pp. 15–26 (2007)

    Google Scholar 

  13. Liang, S., Hudak, P., Jones, M.P.: Monad transformers and modular interpreters. In: POPL 1995: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1995)

    Google Scholar 

  14. Martin, W.A.: Determining the equivalence of algebraic expressions by hash coding. Journal of the Association for Computing Machinery 18(4), 549–558 (1971)

    MATH  Google Scholar 

  15. Olsson, R.: Inductive functional programming using incremental program transformation. Artificial Intelligence 74(1), 55–81 (1995)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. Spivey, M.: Algebras for combinatorial search. In: Workshop on Mathematically Structured Functional Programming (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Miyazaki, 1-1 W. Gakuenkibanadai, 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. Fakultät Wirtschaftsinformatik und Angewandte Informatik, Otto-Friedrich-Universität Bamberg, 96045, Bamberg, Germany

    Ute Schmid  & Emanuel Kitzelmann  & 

  2. Institute for Computing and Information Sciences, Radboud University Nijmegen, Heijendaalseweg 135, 6525AJ, Nijmegen, The Netherlands

    Rinus Plasmeijer

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katayama, S. (2010). Recent Improvements of MagicHaskeller. In: Schmid, U., Kitzelmann, E., Plasmeijer, R. (eds) Approaches and Applications of Inductive Programming. AAIP 2009. Lecture Notes in Computer Science, vol 5812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11931-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11931-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11930-9

  • Online ISBN: 978-3-642-11931-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation