Library for systematic search for expressions

Authors:
Susumu Katayama
Affiliations:
Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki, Japan
Venue:
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Year:
2006

Citing 5
Cited 1

Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
QuickCheck: a lightweight tool for random testing of Haskell programs

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Template meta-programming for Haskell

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Generalizing generalized tries

Journal of Functional Programming
Combinators for breadth-first search

Journal of Functional Programming

A User-friendly Interface for a Lightweight Verification System

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In our previous work we showed that systematic search approach to inductive functional programming automation makes a remarkably efficient algorithm, but the applicability of the implemented program was limited by the very poor interpreter incorporated. In this paper, we present a library-based implementation of our systematic search algorithm which is supposed to be used with a well-known Haskell interpreter.