Skip to main content
SpringerLink
Log in

The Oz Programming Model

  • Chapter
  • First Online:
Computer Science Today

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

Abstract

The Oz Programming Model (OPM) is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model. This is particularly interesting for concurrent object-oriented programming, for which no comprehensive formal niodel existed until now. The model can be extended so that it can express encapsulated problem solvers generalizing the problem solving capabilities of constraint logic programming. OPM has been developed together with a concomitant programming language Oz, which is designed for applications that require complex symbolic computations, organization into multiple agents, and soft real-time control. An efficient, robust, and interactive implementation of Oz is freely available.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. AÏt-Kaci, A. Podelski, and G. Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1–2):263–283, 1994.

    Article  Google Scholar 

  2. R. Backofen. A complete axiomatization of a theory with feature and arity constraints. Journal of Logic Programming, 1995. To appear.

    Google Scholar 

  3. L. Cardelli. Obliq: A Language with Distributed Scope. In Proc. 22nd Ann. ACM Symposium on Principles of Programming Languages (POPL'95), pages 286–297, 1995.

    Google Scholar 

  4. A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255–292, 1983.

    Google Scholar 

  5. M. Henz, G. Smolka, and J. Würtz. Object-oriented concurrent constraint programming in Oz. In V. Saraswat and P. V. Hentenryck, editors, Principles and Practice of Constraint Programming, pages 27–48. The MIT Press, Cambridge, MA, 1995.

    Google Scholar 

  6. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19/20:503–582, 1994.

    Article  Google Scholar 

  7. S. Janson and S. Haridi. Programming paradigms of the Andorra kernel language. In V. Saraswat and K. Ueda, editors, Logic Programming, Proc. 1991 Int. Symposium, pages 167–186. The MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  8. S. Janson, J. Montelius, and S. Haridi. Ports for objects. In Research Directions in Concurrent Object-Oriented Programming. The MIT Press, Cambridge, MA, 1993.

    Google Scholar 

  9. J. Launchbury. A natural semantics for lazy evaluation. In Proc. 20th Ann. ACM Symposium on Principles of Programming Languages (POPL '93), pages 144–154, 1993.

    Google Scholar 

  10. M. J. Maher. Logic semantics for a class of committed-choice programs. In J.-L. Lassez, editor, Logic Programming, Proc. 4th Int. Conference, pages 858–876. The MIT Press, Cambridge, MA, 1987.

    Google Scholar 

  11. M. Mehl, R. Scheidhauer, and C. Schulte. An abstract machine for Oz. In Proc. 7th Int. Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'95). Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995. To appear.

    Google Scholar 

  12. R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  13. R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.

    Google Scholar 

  14. T. Müller, K. Popow, C. Schulte, and J. Würtz. Constraint programming in Oz. DFKI Oz documentation series, DFKI, Saarbrücken, Germany, 1994.

    Google Scholar 

  15. J. Niehren. Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen. Doctoral Dissertation. Universität des Saarlandes, Saarbrücken, Germany, December 1994. Submitted.

    Google Scholar 

  16. J. Niehren and G. Smolka. A confluent relational calculus for higher-order programming with constraints. In J.-P. Jouannaud, editor, Proc. 1st Int. Conference on Constraints in Computational Logics (CCL'94), pages 89–104. Lecture Notes in Computer Science, Vol. 845, Springer-Verlag, Berlin, 1994.

    Google Scholar 

  17. G. D. Plotkin. A structural approach to operational semantics. DAIMI FN-19, Dept. of Computer Science, Aarhus University, Denmark, 1981. Reprinted 1991.

    Google Scholar 

  18. V. A. Saraswat. Concurrent Constraint Programming. The MIT Press, Cambridge, MA, 1993.

    Google Scholar 

  19. C. Schulte and G. Smolka. Encapsulated search in higher-order concurrent constraint programming. In M. Bruynooghe, editor, Logic Programming, Proc. 1994 Int. Symposium, pages 505–520. The MIT Press, Cambridge, MA, 1994.

    Google Scholar 

  20. C. Schulte, G. Smolka, and J. Würtz. Encapsulated search and constraint programming in Oz. In A. Borning, editor, Proc. 2nd Int. Workshop on Principles and Practice of Constraint Programming (PPCP'94), pages 134–150. Lecture Notes in Computer Science, Vol. 874, Springer-Verlag, Berlin, 1994.

    Google Scholar 

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

    Article  Google Scholar 

  22. G. Smolka. The definition of Kernel Oz. In A. Podelski, editor, Constraints: Basics and Trends, pages 251–292. Lecture Notes in Computer Science, Vol. 910, Springer-Verlag, Berlin, 1995.

    Google Scholar 

  23. G. Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, Proc. 1st Int. Conference on Constraints in Computational Logics (CCL'94), pages 50–72. Lecture Notes in Computer Science, Vol. 845, Springer-Verlag, Berlin, 1994.

    Google Scholar 

  24. G. Smolka. Fresh: A higher-order language with unification and multiple results. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Relations, Functions, and Equations, pages 469–524. Prentice-Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  25. G. Smolka. An Oz primer. DFKI Oz documentation series, DFKI, Saarbrücken, Germany, 1995.

    Google Scholar 

  26. G. Smolka and R. Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229–258, 1994.

    Article  Google Scholar 

  27. G. Winskel. The Formal Semantics of Programming Languages. Foundations of Computing. The MIT Press, Cambridge, MA, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Systems Lab, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 66123, Saarbrücken, Germany

    Gert Smolka

Authors
  1. Gert Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Smolka, G. (1995). The Oz Programming Model. In: van Leeuwen, J. (eds) Computer Science Today. Lecture Notes in Computer Science, vol 1000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015252

Download citation

  • DOI: https://doi.org/10.1007/BFb0015252

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49435-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation