Nordin, T. and A. Tolmach, Modular lazy search for constraint satisfaction problems, Journal of Functional Programming (2001), (To appear.). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Preliminary Proceedings of the ACM SIGPLAN Haskell Workshop.. - (editor) (2001) (Correct)
....states, and collection of solutions. In earlier work, Nordin and Tolmach showed that a large variety of useful algorithms which look quite di#erent from one another when written imperatively can be obtained in the lazy framework just by varying the labeling and pruning functions [28]. The underlying algorithm is a simple composition of functions, where all the intermediate results are trees or lists. solver : Labeler a Pruner a CSP [State] solver labeler pruner csp = filter (complete csp) map fst . leaves . prune pruner . labeler csp) mkSearchTree) csp ....
Nordin, T. and A. Tolmach, Modular lazy search for constraint satisfaction problems, Journal of Functional Programming (2001), (To appear.).
Playing by the Rules: Rewriting as a practical.. - Jones, Tolmach, Hoare (2001) (13 citations) Self-citation (Tolmach) (Correct)
....of inconsistent states, and collection of solutions. In earlier work, Nordin and Tolmach showed that a large variety of useful algorithms which look quite different from one another when written imperatively can be obtained in the lazy framework just by varying the labeling and pruning functions [28]. The underlying algorithm is a simple composition of functions, where all the intermediate results are trees or lists. solver labeler pruner asp = filter (aomplete asp) map fst leaves prune pruner (labeler asp) mkSearahTree) asp Here CSP is a type describing instances of constraint ....
Nordin, T. and A. Tolmach, Modular lazy search for constraint satisfaction problems, Journal of Functional Programming (2001), (To appear.).
Playing by the Rules: Rewriting as a practical.. - Jones, Tolmach, Hoare (2001) (13 citations) Self-citation (Tolmach) (Correct)
....inconsistent states, and collection of solutions. In earlier work, Nordin and Tolmach showed that a large variety of useful algorithms which look quite di erent from one another when written imperatively can be obtained in the lazy framework just by varying the labeling and pruning functions [28]. The underlying algorithm is a simple composition of functions, where all the intermediate results are trees or lists. solver : Labeler a Pruner a CSP [State] solver labeler pruner csp = filter (complete csp) map fst . leaves . prune pruner . labeler csp) mkSearchTree) csp ....
Nordin, T. and A. Tolmach, Modular lazy search for constraint satisfaction problems, Journal of Functional Programming (2001), (To appear.).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC