Efficient exhaustive generation of functional programs using Monte-Carlo search with iterative deepening

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5351 LNAI, Issue , 2008, Pages 199-210

  Katayama, Susumu ^a  

^a UNIVERSITY OF MIYAZAKI   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATIC PROGRAMMING; COMPUTER PROGRAMMING; GENETIC PROGRAMMING; MONTE CARLO METHODS; PROGRAMMING THEORY;

COMPUTATIONAL COSTS; FUNCTIONAL PROGRAMS; ITERATIVE DEEPENING; MONTE-CARLO; PICK-UP; PROGRAM EQUIVALENCES; PROGRAM GENERATIONS; PROGRAM SIZES; RANDOM TESTING; SEARCH RESULTS; SUB-EXPRESSIONS;

FUNCTIONAL PROGRAMMING;

EID: 59349106706     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89197-0_21     Document Type: Conference Paper

References (13)

1. Olsson, R.: Inductive functional programming using incremental program transformation. Artificial Intelligence 74(1), 55-81 (1995)
2. Yu, T.: Polymorphism and genetic programming. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tetamanzi, A.G.B., Langdon, W.B. (eds.) EuroGP 2001. LNCS, vol. 2038, pp. 218-233. Springer, Heidelberg (2001)
3. Schmid, U.: Inductive Synthesis of Functional Programs - Learning Domain-Specific Control Rules and Abstract Schemes. Springer, Heidelberg (2001); Habilitation thesis
4. Kitzelmann, E.: Data-driven induction of recursive functions from input/outputexamples. In: AAIP 2007: Proceedings of the Workshop on Approaches and Applications of Inductive Programming, pp. 15-26 (2007)
5. Katayama, S.: Power of brute-force search in strongly-typed inductive functional programming automation. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 75-84. Springer, Heidelberg (2004)
6. Katayama, S.: Library for systematic search for expressions and its efficiency evaluation. WSEAS Transactions on Computers 12(5), 3146-3153 (2006)
7. Katayama, S.: Systematic search for lambda expressions. In: Trends in Functional Programming, Intellect, vol. 6, pp. 111-126 (2007)
8. 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)
9. Spivey, M.: Combinators for breadth-first search. Journal of Functional Programming 10(4), 397-408 (2000)
10. Spivey, M.: Algebras for combinatorial search. In: Workshop on Mathematically Structured Functional Programming (2006)
11. Hudelmaier, J.: Bounds on cut-elimination in intuitionistic propositional logic. Archive for Mathematical Logic 31, 331-354 (1992)
12. Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 795-807 (1992)
13. Katayama, S.: MagicHaskeller (2005), http://nautilus.cs.miyazaki-u.ac.jp/ ~skata/MagicHaskeller.html