Skip to main content
Springer Nature Link
Log in

Programming Deep Concurrent Constraint Combinators

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 2000)

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

Included in the following conference series:

Abstract

Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as combination mechanism. It introduces primitives and techniques needed to program constraint combinators from computation spaces. The paper applies computation spaces to a broad range of combinators: negation, generalized reification, disjunction, and implication. Even though computation spaces have been conceived in the context of Oz, they are mainly programming language independent. This point is stressed by discussing them here in the context of Standard ML with concurrency features.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Denys Duchier and Claire Gardent. A constraint-based treatment of descriptions. In H. C. Bunt and E. G. C. Thijsse, editors, Third International Workshop on Computational Semantics (IWCS-3), pages 71–85, Tilburg, NL, January 1999.

    Google Scholar 

  2. Thom Frühwirth. Constraint handling rules. In Andreas Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science, pages 90–107. Springer-Verlag, 1995.

    Google Scholar 

  3. Seif Haridi, Sverker Janson, and Catuscia Palamidessi. Structural operational semantics for AKL. Future Generation Computer Systems, 8:409–421, 1992.

    Article  Google Scholar 

  4. Sverker Janson. AKL — AMultiparadigm Programming Language. PhD thesis, SICS Swedish Institute of Computer Science, SICS Box 1263, S-164 28 Kista, Sweden, 1994. SICS Dissertation Series 14.

    Google Scholar 

  5. Michael Mehl. The Oz Virtual Machine: Records, Transients, and Deep Guards. Doctoral dissertation, Universität des Saarlandes, Im Stadtwald, 66041 Saarbrücken, Germany, 1999.

    Google Scholar 

  6. Michael Mehl, Ralf Scheidhauer, and Christian Schulte. An abstract machine for Oz. In Manuel Hermenegildo and S. Doaitse Swierstra, editors, Programming Languages, Implementations, Logics and Programs, Seventh International Symposium, PLILP’95, volume 982 of Lecture Notes in Computer Science, pages 151–168, Utrecht, The Netherlands, September 1995. Springer-Verlag.

    Chapter  Google Scholar 

  7. Vijay A. Saraswat. Concurrent Constraint Programming. ACM Doctoral Dissertation Awards: Logic Programming. The MIT Press, Cambridge, MA, USA, 1993.

    Google Scholar 

  8. Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 232–245, San Francisco, CA, USA, January 1990. ACM Press.

    Google Scholar 

  9. Christian Schulte. Oz Explorer: A visual constraint programming tool. In Lee Naish, editor, Proceedings of the Fourteenth International Conference on Logic Programming, pages 286–300, Leuven, Belgium, July 1997. The MIT Press.

    Google Scholar 

  10. Christian Schulte. Programming constraint inference engines. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, pages 519–533, Schloβ Hagenberg, Linz, Austria, October 1997. Springer-Verlag.

    Chapter  Google Scholar 

  11. Gert Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, volume 1000 of Lecture Notes in Computer Science, pages 324–343. Springer-Verlag, Berlin, 1995.

    Chapter  Google Scholar 

  12. Gert Smolka. Concurrent constraint programming based on functional programming. In Chris Hankin, editor, Programming Languages and Systems, volume 1381 of Lecture Notes in Computer Science, pages 1–11, Lisbon, Portugal, 1998. Springer-Verlag.

    Chapter  Google Scholar 

  13. Pascal Van Hentenryck and Yves Deville. The cardinality operator: A new logical connective for constraint logic programming. In Frédéric Benhamou and Alain Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 383–403. The MIT Press, Cambridge, MA, USA, 1993.

    Google Scholar 

  14. Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Design, implementation, and evaluation of the constraint language cc(FD). The Journal of Logic Programming, 37(1–3):139–164, October 1998.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50, 66041, Saarbrücken, Germany

    Christian Schulte

Authors
  1. Christian Schulte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science New Science Hall, New Mexico State University, Box 30001, MS CS, Stewart Street, Las Cruces, NM, 88003, USA

    Enrico Pontelli

  2. COPPE/Sistemas e Computação Centro de Tecnologia, Universidade Federal do Rio de Janeiro, Bloco H-319, Cx. Postal 68511, Rio de Janeiro, Brazil, CEP:21945-970

    Vítor Santos Costa

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schulte, C. (1999). Programming Deep Concurrent Constraint Combinators. In: Pontelli, E., Santos Costa, V. (eds) Practical Aspects of Declarative Languages. PADL 2000. Lecture Notes in Computer Science, vol 1753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46584-7_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-46584-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66992-0

  • Online ISBN: 978-3-540-46584-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics