Library for systematic search for expressions and its efficiency evaluation

WSEAS Transactions on Computers

Volumn 5, Issue 12, 2006, Pages 3146-3153

  Katayama, Susumu ^a  

^a UNIVERSITY OF MIYAZAKI   (Japan)

Author keywords

Artificial intelligence; Functional programming; Inductive program synthesis; Library design; Metaprogramming; Template Haskell

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTOMATIC PROGRAMMING; COMPUTER SOFTWARE SELECTION AND EVALUATION; ONLINE SEARCHING; PROGRAM INTERPRETERS;

FUNCTIONAL PROGRAMMING; INDUCTIVE PROGRAM SYNTHESIS; METAPROGRAMMING; TEMPLATE HASKELL;

DIGITAL LIBRARIES;

EID: 33749061502     PISSN: 11092750     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Susumu Katayama. Power of brute-force search in strongly-typed inductive functional programming automation. In PRICAI 2004: Trends in Artificial Intelligence, 8th Pacific Rim International Conference on Artificial Intelligence, LNAI 3157, pages 75-84, August 2004.
2. Susumu Katayama. Systematic search for lambda expressions. In Trends in Functional Programming, volume 6. Intellect, Bristol, UK, in preparation.
3. M. Spivey. Combinators for breadth-first search. Journal of Functional Programming, 10(4):397-408, 2000.
4. Ranf Hinze. Generalizing generalized tries. Journal of Functional Programming, 10(4):327-351, 2000.
5. Sheng Liang, Paul Hudak, and Mark P. Jones. Monad transformers and modular interpreters. In POPL'95. 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995.
6. Tim Sheard and Simon Peyton Jones. Template metaprogramming for Haskell. In Haskell Workshop 2002, October 2002.
7. Koen Claessen and John Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In International Conference on Functional Programming, pages 268-279. ACM, 2000.
8. Neil Mitchell. Hoogle, http://www-users.cs.york.ac.uk/~ndm/projects/ hoogle.php.