Treffer: Solving combinatorial problems with a constraint functional logic language
Title:
Solving combinatorial problems with a constraint functional logic language
Source:
PADL 2003 : practical aspects of declarative languages (New Orleans LA, 13-14 January 2003)Lecture notes in computer science. :320-338
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Langage fonctionnel, Functional language, Lenguaje funcional, Non déterminisme, Non determinism, No determinismo, Offre service, Proposals, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème combinatoire, Combinatorial problem, Problema combinatorio, Programmation fonctionnelle, Functional programming, Programación funcional, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation logique, Logical programming, Programación lógica
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Depto. de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Spain
Depto. de Sistemas Informáticos y Programación Universidad Complutense de Madrid, Spain
Depto. de Sistemas Informáticos y Programación Universidad Complutense de Madrid, Spain
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15133207
Database:
PASCAL Archive
Weitere Informationen
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 TOY that provides FD constraints, and shows, by examples, that TOY(FD)combines the power of constraint logic programming with the higher-order characteristics of functional logic programming.