Combinators for breadth-first search

Journal of Functional Programming

Volumn 10, Issue 4, 2000, Pages 397-408

  Spivey, Michael ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347268310     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800003749     Document Type: Article

References (5)

1. Bird, R. S. (1987) Introduction to the theory of lists. In: M. Broy (editor), Logics of Programming and Calculi of Discrete Design, pp. 5-42. Springer-Verlag.
2. Seres, S., Spivey, J. M. and Hoare, C. A. R. (1999) Algebra of logic programming. In: D. De Schreye (editor), Proceedings of the 1999 International Conference on Logic Programming, pp. 184-199. MIT Press.
3. Spivey, J. M. and Seres, S. (1999) Embedding Prolog in Haskell. In: E. Meier (editor), Proceedings of Haskell'99. Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht.
4. Spivey, J. M. and Seres, S. (2000) The algebra of searching. In: J. Davies and J. C. P. Woodcock (editors), Proceedings of a symposium in celebration of the work of C. A. R. Hoare. MacMillan (forthcoming).
5. Wadler, P. L. (1985) How to replace failure by a list of successes. In: J.-P. Jouannaud (editor), Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, 201, pp. 113-128. Springer-Verlag.