Backtracking, interleaving, and terminating monad transformers (functional pearl)

ACM SIGPLAN Notices

Volumn 40, Issue 9, 2005, Pages 192-203

  Kiselyov, Oleg ^a   Shan, Chung Chieh ^b   Sabry, Amr ^c   Friedman, Daniel P ^c  

^a FNMOC ^*  (United States)

^b HARVARD UNIVERSITY   (United States)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Continuations; Control delimiters; Haskell; Logic programming; Prolog; Streams

Indexed keywords

CONTINUATIONS; CONTROL DELIMITERS; HASKELL; PROLOG; STREAMS;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEM RECOVERY; MATHEMATICAL MODELS; USER INTERFACES;

LOGIC PROGRAMMING;

EID: 33646062762     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1090189.1086390     Document Type: Article

References (31)

1. MonadPlus. http://www.haskell.org/hawiki/MonadPlus, 2005.
2. ARIOLA, Z. M., HERBELIN, H., AND SABRY, A. A type-theoretic foundation of continuations and prompts. In ACM SIGPLAN International Conference on Functional Programming (2004), ACM Press, New York, pp. 40-53.
3. BROMAGE, A. Initial (term) algebra for a state monad, http://www.haskell.org/pipermail/haskell-cafe/2885-January/008259.html, Jan. 2005.
4. BROMAGE, A. A MonadPlusT with fair operations and pruning. http://www.haskell.org/pipermail/haskell/2005-June/016037.html, June 2005.
5. DANVY, O., AND FILINSKI, A. Abstracting control. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice (1990), ACM Press, New York, pp. 151-160.
6. DE BRUIN, A., AND DE VINK, E. P. Continuation semantics for PROLOG with cut. In TAPSOFT, Vol.1 (1989), J. Díaz and F. Orejas, Eds., vol. 351 of Lecture Notes in Computer Science, Springer, pp. 178-192.
7. DYBVIG, R. K., PEYTON JONES, S. L., AND SABRY, A. A monadic framework for delimited continuations. Tech. Rep. TR615, Department of Computer Science, Indiana University, June 2005.
8. FEDERHEN, S. A mathematical semantics for PLANNER. Master's thesis, University of Maryland, 1980.
9. FOSCA GIANNOTTI, D. P., AND ZANIOLO, C. Semantics and expressive power of nondeterministic constructs in deductive databases. Journal of Computer and System Sciences 62, 1 (2001), 15-42.
10. FRIEDMAN, D. P., AND KISELYOV, O. A declarative applicative logic programming system. http://kanren.sourceforge.net/, 2005.
11. HINZE, R. Deriving backtracking monad transformers. In ICFP '00: Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (2000), ACM Press, pp. 186-197.
12. JONES, M. P., AND DUPONCHEEL, L. Composing monads. Tech. Rep. YALEU/DCS/RR-1004, Department of Computer Science, Yale University, New Haven, 1993.
13. KISELYOV, O. How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible. Tech. Rep. TR611, Department of Computer Science, Indiana University, 2005.
14. LIANG, S., HUDAK, P., AND JONES, M. Monad transformers and modular interpreters. In POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (New York, NY, USA, 1995), ACM Press, pp. 333-343.
15. McCARTHY, J. A Basis for a Mathematical Theory of Computation. In Computer Programming and Formal Systems (1963), P. Braffort and D. Hirschberg, Eds., North-Holland, Amsterdam, pp. 33-70.
16. Moooi, E. An abstract view of programming languages. Tech. Rep. ECS-LFCS-90-113, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1990.
17. MOGGI, E. Notions of computation and monads. Information and Computation 93, 1 (1991), 55-92.
18. NAISH, L. Pruning in logic programming. Tech. Rep. 95/16, Department of Computer Science, University of Melbourne, Melbourne, Australia, June 1995.
19. PEYTON JONES, S. L., AND SHIELDS, M. B. Practical type inference for arbitrary-rank types, http://research.microsoft.com/~simonpj/papers/putting/, Apr. 2004.
20. PIERCE, B. C., ET AL. What is MonadPlus good for? http://www.haskell.org/ pipermail/haskell-cafe/2005-February/009072.html, Feb. 2005.
21. ROUNDY, D. What is MonadPlus good for? http://www.haskell.org/pipermail/ haskell-cafe/2005-February/009081.html, Feb. 2005.
22. ROY, P. V. 1983-1993: The wonder years of sequential Prolog implementation. Journal of Logic Programming 19-20 (1994), 385-441.
23. SERES, S., SPIVEY, J. M., AND HOARE, C. A. R. Algebra of Logic Programming. In ICLP (1999), pp. 184-199.
24. SHAN, C. Shift to control. In Proceedings of the 5th workshop on Scheme and Functional Programming (2004), O. Shivers and O. Waddell, Eds., pp. 99-107. Technical report, Computer Science Department, Indiana University, 2004.
25. SISKIND, J. M., AND McALLESTER, D. A. Nondeterministic Lisp as a substrate for constraint logic programming. In AAAI-93: Proceedings of the 11th National Conference on Artificial Intelligence (11-15 July 1993), AAAI Press, pp. 133-138.
26. SPIVEY, J. M. Combinators for breadth-first search. Journal of Functional Programming 10, 4 (2000), 397-408.
27. TULLSEN, M. First class patterns. In. Practical Aspects of Declarative Languages, 2nd International Workshop (2000), E. Pontelli and V. S. Costa, Eds., vol. 1753 of Lecture Notes in Computer Science, Springer-Verlag, pp. 1-15.
28. TURK, R. What is MonadPlus good for? http://www.haskell.org/pipermail/ haskell-cafe/2005-February/009086.html, Feb. 2005.
29. WADLER, P. L. Comprehending monads. Mathematical Structures in Computer Science 2, 4 (1992), 461-493.
30. WADLER, P. L. The essence of functional programming. In POPL '92: Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1992), ACM Press, pp. 1-14.
31. WAND, M., AND VAILLANCOURT, D. Relating models of backtracking. In ACM SIGPLAN International Conference on Functional Programming (2004), pp. 54-65.