Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Practical Aspects of Declarative Languages

PADL 2003: Practical Aspects of Declarative Languages pp 320–338Cite as

Solving Combinatorial Problems with a Constraint Functional Logic Language

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2562))

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 ofthe functional logic language TOYthat provides FD constraints, and shows, by examples, that TOY(FD) combines the power ofconstrain t logic programming with the higher-order characteristics off unctional logic programming.

Fernández was partially supported by the projects TIC2001-2705-C03-02 and TIC2002-04498-C05-02 funded by the Spanish Ministry of Science and Technology.

Hortalá-González and Fernando Sáenz-Pérez were supported by the Spanish project PR 48/01-9901 funded by UCM.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Antoy and M. Hanus. Compiling multi-paradigm declarative programs into prolog. In H. Kirchner and C. Ringeissen, editors, 3rd International Workshop on Frontiers of Combining Systems, number 1794 in LNCS, pages 171–185. Springer-Verlag, 2000.

    Google Scholar 

  2. M. Carlsson, G. Ottosson, and B. Carlson. An pen-ended finite domain constraint solver. In U. Montanari and F. Rossi, editors, 9th International Symposium on Programming Languages: Implementations, Logics und Programs (PLILP’97), number 1292 in LNCS, pages 191–206, Southampton, UK, 1997. Springer-Verlag.

    Google Scholar 

  3. M. Hanus (editor). Pakcs 1.4.0, user manual. The Portland Aachen Kiel Curry System. Available from http://www.informatik.uni-kiel.de/∼pakcs/, 2002.

  4. A.J. Fernández, T. Hortalá-González, and F. Sáenz-Pérez. TOY(FD): User manual, latest Version. Available at http://www.lcc.uma.es/∼afdez/cflpfd/, 2002.

  5. R. Fourer, D.M. Gay, and B.W. Kernighan. Ampl: A modeling language for mathematical programming. Scientific Press, 1993.

    Google Scholar 

  6. J.C. González-Moreno, M.T. Hortalá-González, and M. Rodríguez-Artalejo. Polymorphic types in functional logic programming. In Aart Middeldorp and Taisuke Sato, editors, 4th International Symposium on Functional und Logic Programming (FLOPS’99), number 1722 in LNCS, pages 1–20, Tsukuba, Japan, November 1999. Springer-Verlag. There is special issue ofthe Journal of Functional and Logic Programming, 2001. See http://danae.uni-muenster.de/lehre/kuchen/JFLP.

    Chapter  Google Scholar 

  7. M. Hanus. The integration off unctions into logic programming: A survey. The Journal of Logic Programming, 19-20:583–628, 1994. Special issue: Ten Years of Logic Programming.

    Article  MathSciNet  Google Scholar 

  8. J. Jaffar and M. Maher. Constraint logic programming: a survey. The Journal of Logic Programming, 19-20:503–581, 1994.

    Article  MathSciNet  Google Scholar 

  9. F.J. López-Fraguas and J. Sánchez-Hernández. TOY: A multiparadigm declarative system. In P. Narendran and M. Rusinowitch, editors, 10th International Conference on Rewriting Techniques und Applications, number 1631 in LNCS, pages 244–247, Trento, Italy, 1999. Springer-Verlag. The system and further documentation including programming examples is available at http://babel.dacya.ucm.es/toy and http://titan.sip.ucm.es/toy.

    Google Scholar 

  10. G. Smolka. The Oz programming model. In Jan Van Leeuwen, editor, Computer Science Today, number 1000 in LNCS, pages 324–343, Berlin, 1995. Springer-Verlag.

    Chapter  Google Scholar 

  11. P. Van Hentenryck. Constraint satisfaction in logic programming. The MIT Press, Cambridge, MA, 1989.

    Google Scholar 

  12. P. Van Hentenryck. The OPL optimization programming language. The MIT Press, Cambridge, MA, 1999.

    Google Scholar 

  13. N-F. Zhou. Channel Routing with Constraint Logic Programming and Delay. In 9th International Conference on Industrial Applications of Artificial Intelligence, pages 217–231. Gordon and Breach Science Publishers, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Spain

    Antonio J. Fernández

  2. Depto. de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Spain

    Teresa Hortalá-González & Fernando Sáenz-Pérez

Authors
  1. Antonio J. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teresa Hortalá-González
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Sáenz-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department Logic and Functional Programming Group, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby B.C., Canada

    Veronica Dahl

  2. Avaya Labs, 233 Mount Airy Road, Basking Ridge, 07920, NJ, USA

    Philip Wadler

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández, A.J., Hortalá-González, T., Sáenz-Pérez, F. (2003). Solving Combinatorial Problems with a Constraint Functional Logic Language. In: Dahl, V., Wadler, P. (eds) Practical Aspects of Declarative Languages. PADL 2003. Lecture Notes in Computer Science, vol 2562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36388-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-36388-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00389-2

  • Online ISBN: 978-3-540-36388-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation