Title
Solving Combinatorial Problems with a Constraint Functional Logic Language
Abstract
This paper describes a proposal to incorporate finite domain constraints in a functional logic system. The proposal integrates functions, higher-order patterns, partial applications, non-determinism, logical variables, currying, types, lazyness, domain variables, constraints and finite domain propagators.The paper also presents TOY(FD), an extension of the functional logic language TOYthat provides FD constraints, and shows, by examples, that TOY(FD) combines the power ofconstraint logic programming with the higher-order characteristics of functional logic programming.
Year
DOI
Venue
2003
10.1007/3-540-36388-2_22
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Keywords
Field
DocType
functional logic programming,higher order
Functional logic programming,Discrete mathematics,Horn clause,Programming language,Computer science,Logic optimization,Multimodal logic,Theoretical computer science,Prolog,Logic programming,Constraint logic programming,Dynamic logic (modal logic)
Conference
Volume
ISSN
ISBN
2562
0302-9743
3-540-00389-4
Citations 
PageRank 
References 
15
0.70
7
Authors
3
Name
Order
Citations
PageRank
AJ Fernandez1243.80
Maria Teresa Hortalá-González21339.49
Fernando Sáenz-Pérez36915.50