An abstract machine for Oz

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 982, Issue , 1995, Pages 151-168

  Mehl, Michael ^a   Scheidhauer, Ralf ^a   Schulte, Christian ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS;

ABSTRACT MACHINES; CONCURRENT CONSTRAINT; CONCURRENT OBJECTS; INTERACTIVE IMPLEMENTATION; LOCAL COMPUTATION; RATIONAL TREES;

LISP (PROGRAMMING LANGUAGE);

EID: 84958680914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026819     Document Type: Conference Paper

References (25)

1. Hassan Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. Logic Programming Series. The MIT Press, Cambridge, MA, 1991.
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. Tile MIT Press.
3. William Clinger and Jonathan Rees. The Revised 4 Report on the Algorithmic Language Scheme. LISP Pointers, IV(3):1-55, July-September 1991.
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.
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.
6. Martin Henz, Gert Smolka, and Jörg Würtz. Object-oriented concurrent constraint programming in Oz. In Vijay Saraswat and Pascal Van Hentenryek, editors, Principles and Practice of Constraint Programming, chapter 2, pages 27 48. The MIT Press, Cambridge, MA, 1995.
7. Paul Hudak, Philip Wadler, et al. Report on the programming language Haskell. Technical Report YALEU/DCS/RR/777, Yale University, 1990.
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.
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.
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.
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.
12. Robin Milner, Mads Tofte, and Robert Harper. Definition of Standard ML. The MIT Press, Cambridge, MA, 1990.
13. Johan Montellus and Khayri A. M. Ali. An And/Or-parallel implementation of AKL. New Generation Computing, 13-14, August 1995.
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. SpringeroVerlag. To appear
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.
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.
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.
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.
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.
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.
21. Gert Smolka and Raft Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229-258, April 1994.
22. Gert Smolka and Raft Treinen (ed.). DFKI Oz documentation series. Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrficken, Germany, 1994.
23. Pascal Van Henteuryck, 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.
24. Peter Van Roy. 1983-1993: The wonder years of sequential Prolog implementation. Journal of Logic Programming, 19/20:385-441, May/July 1994.
25. David H. D. Warren. An abstract Prolog instruction set. Technical Note 309, SRI International, Artificial Intelligence Center, Menlo Park, CA, October 1983.