Monadic constraint programming

Journal of Functional Programming

Volumn 19, Issue 6, 2009, Pages 663-697

  Schrijvers, Tom ^a   Stuckey, Peter ^b   Wadler, Philip ^c  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING SYSTEMS; CONSTRAINT PROGRAMS; CONSTRAINT SOLVERS; ENGINE CONTROL; SATISFIABILITY; SEARCH STRATEGIES; SEARCH TREES;

FORESTRY; LOGIC PROGRAMMING; SEARCH ENGINES;

CONSTRAINT THEORY;

EID: 74349088250     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796809990086     Document Type: Article

References (32)

1. Apt, K R., Brunekreef, J., Partington, V. & Schaerf, A. (1998) Alma-o: An imperative language that supports declarative programming, ACM Trans. Program. Lang. Syst. 20 (5): 1014-1066.
2. Barnier, N. (Dec. 2002) Application de la programmation par contraintes ̀a des problmes de gestion du trafic áerien, PhD thesis [online]. Toulouse, France: Institut National Polytechnique de Toulouse. Available at: http://www.recherche.enac.fr/opti/papers/ thesis/ Last accessed 3 August 2009.
3. Bird, R. S. (2006) A program to solve Sudoku, Journal of Functional Programming 16 (6): 671-679.
4. Brassel, B. & Huch, F. (2007) On a tighter integration of Functional and Logic Programming. In The 5th Asian Symposium on Programming Languages and Systems (APLAS'07), Shao, Zhong (ed), Lecture Notes in Computer Science, vol.4807. Springer, Berlin/Heidelberg, pp. 122-138.
5. Casas, A., Cabeza, D., & Hermenegildo, M. V. (2006) A syntactic approach to combining functional notation, lazy evaluation and higher-order in LP systems. In The 8th International Symposium on Functional and Logic Programming (FLOPS'06), Masami Hagiya and Philip Wadler (eds.), Springer, Berlin/Heidelberg, pp. 146-162.
6. Claessen, K., & Ljungl̈of, P. (2000) Typed logical variables in Haskell. In Proceedings of the Haskell Workshop, Montreal, Canada. ACM SIGPLAN.
7. Cook, W. R. (1989) A Denotational Semantics of Inheritance, PhD thesis. Providence, RI: Brown University.
8. ECLiPSe. (2008) Eclipse [online]. Available at http://www.eclipse-clp. org/ Last accessed 3 August 2009.
9. Fischer, S. (2008) Constrained monadic computations [online]. Available at: http://www-ps. informatik.uni-kiel.de/~sebf/projects/constraint-monad.html Last accessed 3 August 2009.
10. Fr̈uhwirth, T. (1998) Theory and practice of Constraint Handling Rules, J. Logic Program. 37 (1-3): 95-138.
11. Hinze, R. (2001) Prolog's control constructs in a functional setting - axioms and implementation, Int. J Foundations Comp. Sci. 12 (2): 125-170.
12. Jaffar, J. & Lassez, J.-L. (1987) Constraint logic programming. In POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Munich, Germany, pp. 111-119.
13. Jansson, P. & Jeuring, J. (1998) Polytypic unification, J. Funct. Program. 8 (5): 527-536.
14. Kiselyov, O., chieh Shan, C., Friedman, D. P. & Sabry, A. (2005) Backtracking, interleaving, and terminating monad transformers (functional pearl), SIGPLAN Not. 40 (9): 192-203.
15. Laburthe, F. & Caseau, Y. (2002) SALSA: A language for search algorithms, Constraints 7 (3): 255-288.
16. Marriott, K. & Stuckey, P. J. (1998) Programming with Constraints: An Introduction. MIT Press, Cambridge, Massachusetts, USA.
17. Michel, L., See, A. & Hentenryck, P Van. (2006) High-level nondeterministic abstractions in. In Cp, Benhamou, F. (ed), Lecture Notes in Computer Science, vol.4204. Springer, pp. 359-374.
18. Overton, D. (2008) Haskell FD library [online]. Available at: http://overtond.blogspot. com/2008/07/pre.html Last accessed 3 August 2009.
19. Ŕegin, J.-C. (1994) A filtering algorithm for constraints of difference in csps. In Aaai, pp. 362-367.
20. Schrijvers, T., Peyton Jones, S., Chakravarty, M. & Sulzmann, M. (2008) Type checking with open type functions. In Proceedings of the 13th ACM SIGPLAN international conference on Functional programming. ACM, pp. 51-62.
21. Schulte, C. (1997) Programming constraint inference engines. In Principles and Practice of Constraint Programming - cp97, Proceedings. Lecture Notes in Computer Science, vol.1330. Springer, pp. 519-533.
22. Schulte, C. (1999) Comparing trailing and copying for CP. In Proceedings of the 16th International Conference on Logic Programming, De Schreye, D. (ed), Las Cruces, NM: MIT Press, pp. 275-289.
23. Schulte, C., Duchier, D., Konvicka, F., Szokoli, G., Tack, G., Lagerkvist, M., Pekczynski, P., Reischuk, R. & Guns, T. (2009) The Gecode generic constraint development environment [online]. Available at: http://www.gecode.org/ Last accessed 3 August 2009.
24. Seres, S. & Spivey, M. J. (Sept. 1999) Embedding Prolog into Haskell. In Haskell Workshop '99. Paris, France.
25. SICStus. (2008) Sicstus Prolog [online]. Available at http://www.sics.se/isl/sicstuswww/ site/index.html Last accessed 3 August 2009.
26. Smolka, G. (1995) The Oz programming model. In Computer Science Today, Lecture Notes in Computer Science, vol.1000. Springer, pp. 324-343.
27. Somogyi, Z., Henderson, F. & Conway, T. (1996) The execution algorithm of Mercury: An efficient purely declarative logic programming language, J. Logic Program. 29 (1-3): 17-64.
28. Van Hentenryck, P. (1999) The OPL Optimization Programming Language. Cambridge, MA: MIT Press.
29. Van Hentenryck, P. & Michel, L. (2005) Constraint-Based Local Search. MIT Press.
30. Van Hentenryck, P. & Michel, L. (2006) Nondeterministic control for hybrid search, Constraints 11 (4): 353-373.
31. Van Hentenryck, P., Perron, L., & Puget, J.-F. (2000) Search and strategies in OPL, Acm Tocl. 1 (2): 285-315.
32. Wadler, P. (1985) How to replace failure by a list of successes, In Proceedings of a Conference on Functional Programming Languages and Computer Architecture. New York: Springer, pp. 113-128.