Abstract
The logic programming language Mercury is designed to support programming in the large. Programmer declarations in conjunction with powerful compile-time analysis and optimization allow Mercury programs to be very efficient. The original design of Mercury did not support constraint logic programming (CLP). This paper describes the extensions we added to Mercury to support CLP. Unlike similarly motivated extensions to Prolog systems, our objectives included preserving the purity of Mercury programs as much as possible, as well as avoiding any impact on the efficiency of non-CLP predicates and functions. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Becket, R., De La Banda, M. G., Marriott, K., Somogyi, Z., Stuckey, P. J., & Wallace, M. (2005). Adding constraint solving to mercury. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3819 LNCS, pp. 118–133). https://doi.org/10.1007/11603023_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
