Skip to main content
SpringerLink
Log in

An abstract machine for Oz

  • Conference paper
  • First Online:
Programming Languages: Implementations, Logics and Programs (PLILP 1995)

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

Abstract

Oz is a concurrent constraint language providing for firstclass procedures, concurrent objects, and encapsulated search. DFKI Oz is an interactive implementation of Oz competitive in performance with commercial Prolog and Lisp systems. This paper describes Amoz, the abstract machine underlying DFKI Oz. Amoz implements rational tree constraints, first-class procedures, local computation spaces for deep guards, and preemptive and fair threads.

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. Hassan Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. Logic Programming Series. The MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  2. Per Brand. A decision graph algorithm for CCP languages. In Leon Sterling, editor, Proceedings of the 1995 International Conference on Logic Programming, pages 433–448, Kanagawa, Japan, June 1995. The MIT Press.

    Google Scholar 

  3. William Clinger and Jonathan Rees. The Revised4 Report on the Algorithmic Language Scheme. LISP Pointers, IV(3):1–55, July–September 1991.

    Google Scholar 

  4. Alain Colmerauer. Prolog and infinite trees. In K.L. Clark and S.-A. Tärnlund, editors, Logic Programming, pages 153–172. Academic Press, 1982.

    Google Scholar 

  5. Alain Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the 2nd International Conference on Fifth Generation Computer Systems, pages 85–99, 1984.

    Google Scholar 

  6. Martin Henz, Gert Smolka, and Jörg Würtz. Object-oriented concurrent constraint programming in Oz. In Vijay Saraswat and Pascal Van Hentenryck, editors, Principles and Practice of Constraint Programming, chapter 2, pages 27–48. The MIT Press, Cambridge, MA, 1995.

    Google Scholar 

  7. Paul Hudak, Philip Wadler, et al. Report on the programming language Haskell. Technical Report YALEU/DCS/RR/777, Yale University, 1990.

    Google Scholar 

  8. Sverker Janson. AKL — A Multiparadigm Programming Language. Dissertation, SICS Swedish Institute of Computer Science, Uppsala University 1994, SICS Box 1263, S-164 28 Kista, Sweden, 1994.

    Google Scholar 

  9. Shmuel Kliger and Ehud Shapiro. From decision trees to decision graphs. In Saumya Debray and Manuel Hermenegildo, editors, North American Conference on Logic Programming, pages 97–116, Austin, TX, 1990. The MIT Press.

    Google Scholar 

  10. Michael J. Maher. Logic semantics for a class of committed-choice programs. In Jean-Louis Lassez, editor, Logic Programming, Proceedings of the Fourth International Conference, pages 858–876, Melbourne, 1987. The MIT Press.

    Google Scholar 

  11. Michael Mehl, Tobias Müller, Konstantin Popov, and Ralf Scheidhauer. DFKI Oz user's manual. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1994.

    Google Scholar 

  12. Robin Milner, Mads Tofte, and Robert Harper. Definition of Standard ML. The MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  13. Johan Montelius and Khayri A. M. Ali. An And/Or-parallel implementation of AKL. New Generation Computing, 13–14, August 1995.

    Google Scholar 

  14. Andreas Podelski and Gert Smolka. Situated simplification. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, LNCS, Marseille, France, September 1995. Springer-Verlag. To appear.

    Google Scholar 

  15. Andreas Podelski and Peter Van Roy. The beauty and beast algorithm: quasilinear incremental tests of entailment and disentailment over trees. In Maurice Bruynooghe, editor, Logic Programming: Proceedings of the 1994 International Symposium, pages 359–374, Ithaca, NY, November 1994. The MIT Press.

    Google Scholar 

  16. 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, January 1990. ACM Press.

    Google Scholar 

  17. Christian Schulte and Gert Smolka. Encapsulated search in higher-order concurrent constraint programming. In Maurice Bruynooghe, editor, Logic Programming: Proceedings of the 1994 International Symposium, pages 505–520, Ithaca, NY, November 1994. The MIT Press.

    Google Scholar 

  18. Christian Schulte, Gert Smolka, and Jörg Würtz. Encapsulated search and constraint programming in Oz. In Alan H. Borning, editor, Second Workshop on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874, pages 134–150, Orcas Island, WA, May 1994. Springer-Verlag.

    Google Scholar 

  19. Gert Smolka. A foundation for higher-order concurrent constraint programming. In Jean-Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 50–72, München, Germany, September 1994. Springer-Verlag.

    Google Scholar 

  20. Gert Smolka. The definition of Kernel Oz. In Andreas Podelski, editor, Constraints: Basics and Trends, Lecture Notes in Computer Science, vol. 910, pages 251–292. Springer-Verlag, 1995.

    Google Scholar 

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

    Google Scholar 

  22. Gert Smolka and Ralf Treinen (ed.). DFKI Oz documentation series. Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1994.

    Google Scholar 

  23. Pascal Van Hentenryck, Vijay Saraswat, and Yves Deville. Design, implementation and evaluation of the constraint language cc(FD). In Andreas Podelski, editor, Constraint Programming: Basics and Trends, Lecture Notes in Computer Science, vol. 910, pages 293–316. Springer-Verlag, 1995.

    Google Scholar 

  24. Peter Van Roy. 1983–1993: The wonder years of sequential Prolog implementation. Journal of Logic Programming, 19/20:385–441, May/July 1994.

    Google Scholar 

  25. David H. D. Warren. An abstract Prolog instruction set. Technical Note 309, SRI International, Artificial Intelligence Center, Menlo Park, CA, October 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Michael Mehl, Ralf Scheidhauer & Christian Schulte

Authors
  1. Michael Mehl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Scheidhauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Schulte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manuel Hermenegildo S. Doaitse Swierstra

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mehl, M., Scheidhauer, R., Schulte, C. (1995). An abstract machine for Oz. In: Hermenegildo, M., Swierstra, S.D. (eds) Programming Languages: Implementations, Logics and Programs. PLILP 1995. Lecture Notes in Computer Science, vol 982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026819

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60359-7

  • Online ISBN: 978-3-540-45048-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation