Skip to main content

Small Oz

  • Chapter
  • 75 Accesses

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 426))

Abstract

In this chapter, we describe the language Small Oz, a simplified version of Oz. The description follows the Oz Programming Model (OPM) [Smo95], a programming model underlying Oz.1 OPM adds higher-order programming and explicit concurrency to the framework of concurrent constraint programming and extends functional programming by introducing data-driven synchronization of concurrent threads through logic variables.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   249.99
Price excludes VAT (USA)
  • Durable hardcover 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. Ken Arnold and James Gosling. The Java Programming Language. The Java Series. Addison-Wesley, Reading, MA, 1996.

    MATH  Google Scholar 

  2. Henri Bal. A comparative study of five parallel programming languages. In EurOpen Spring Conference on Open Distributed Systems in Perspective, pages 209–228, Tromso, Norway, 1991.

    Google Scholar 

  3. Henry Baker and Carl Hewitt. The incremental garbage collection of processes. A.I. Memo No. 454, Massachusetts Institute of Technology, Cambridge, MA, December 1977.

    Google Scholar 

  4. Jack Dennis. First version of a data flow procedure language. In Bernhard Robinet, editor, Proceedings Colloque sur la Programmation, Lecture Notes in Computer Science 19, pages 362–376, Paris, 1974. Springer-Verlag, Berlin.

    Google Scholar 

  5. Ole-Johan Dahl and Kristen Nygaard. Simula, an Algol-based simulation language. Communications of the ACM, 9(9):671–678,1966.

    Article  MATH  Google Scholar 

  6. Ian Foster, Robert Olson, and Steven Tuecke. Productive parallel programming: The PCN approach. Scientific Programming, l(l):55–66,1992.

    Google Scholar 

  7. Adele Goldberg and David Robson. Smalltalk-80: The Language and its Implementation. Addison-Wesley, Reading, MA, 1983.

    MATH  Google Scholar 

  8. Robert Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501–538, 1985.

    Article  MATH  Google Scholar 

  9. Carl Hewitt and Henry Baker. Laws for communicating parallel processes. In Bruce Gilchrist, editor, Proceedings of the World Computer Congress of the IFIP, pages 987–992, Toronto, Canada, August 1977. North-Holland, Amsterdam.

    Google Scholar 

  10. Martin Henz. The Oz notation. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1997.

    Google Scholar 

  11. Carl Hewitt. Viewing control structures as patterns of message passing. Journal of Artificial Intelligence, 8(3):323–364, 1977.

    Article  Google Scholar 

  12. Joachim Niehren. Funktionale Berechnung in einem Uniform Nebenläufigen Kalkül mit Logischen Variablen. Doctoral Dissertation, Universität des Saarlandes, Fachbereich Informatik, Im Stadtwald, 66041 Saarbrücken, Germany, December 1994.

    Google Scholar 

  13. Jens Palsberg and Michael Schwartzbach. Object-Oriented Type Systems. John Wiley & Sons, New York, 1994.

    MATH  Google Scholar 

  14. Ehud Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):413–511, September 1989.

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  16. Gert Smolka. An Oz primer. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1997.

    Google Scholar 

  17. Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229–258, April 1994.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Henz, M. (1998). Small Oz. In: Objects for Concurrent Constraint Programming. The Springer International Series in Engineering and Computer Science, vol 426. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5477-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5477-6_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7502-9

  • Online ISBN: 978-1-4615-5477-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics