A. Mart-n-abadi, L. Cardelli, P. Curien, and J. Evy, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/0304-3975(86)90035-6

A. , Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky et al., A call-by-need lambda calculus, POPL, pp.233-246, 1995.

A. , R. S. Nikhil, and K. K. Pingali, Istructures: Data-structures for parallel computing, ACM Transactions on Programming Languages and Systems, vol.4, issue.11, pp.598-632, 1989.

P. Bar84-]-henk and . Barendregt, The Lambda Calculus. Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics, 1984.

B. , P. S. Barth, R. S. Nikhil, and A. , M-structures: Extending a parallel, non-strict, functional language with state, Functional Programming Languages and Computer Architecture , number 523 in LNCS, pp.538-568, 1991.

B. , S. Brook, and G. Ostheimer, Process semantics of graph reduction, Sixth International Conference on Concurrency Theory, pp.238-252, 1995.

. Bou89, Towards a -calculus for concurrent and communicating systems, Theory and Practice in Software Development, number 351 in LNCS, pp.149-161, 1989.

. Bou92, Asynchrony and the -calculus (note), 1992.

H. Henz, G. Smolka, J. , and W. Urtz, Object-oriented concurrent constraint programming in Oz, Principles and Practice of Constraint Programming, pp.27-48, 1995.

K. Honda and M. Tokoro, An object calculus for asynchronous communication, Proceeding of the European Conference on Object- Oriented Programming, number 512 in LNCS, pp.133-147, 1991.
DOI : 10.1007/BFb0057019

H. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230

K. Ibach, OzFun: Eine funktionale Spache f ur gemischte Eager-und Lazy-Programmierung, 1995.

A. Jeerey, A fully abstract semantics for concurrent graph reduction, Proceedings of the Logic in Computer Science Conference, pp.82-91, 1994.

J. , S. Janson, and S. Haridi, Programming paradigms of the Andorra Kernel Language, Proceedings of the International Symposium on Logic Programming, pp.167-186, 1991.

K. Klop, Term rewriting systems: A tutorial, Bulletin of the European Association of Theoretical Computer Sience, vol.32, pp.143-182, 1987.

K. Kobayashi, B. Pierce, and D. N. Turner, Linearity and the pi-calculus, POPL, 1996.

L. Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.144-154, 1993.
DOI : 10.1145/158511.158618

M. J. Mah87 and . Maher, Logic semantics for a class of committed-choice programs, Logic Programming , Proceedings of the Fourth International Conference, pp.858-876, 1987.

R. Milner, The Polyadic ??-Calculus: a Tutorial, ECS-LFCS Report, 1991.
DOI : 10.1007/978-3-642-58041-3_6

R. Mil92 and . Milner, Functions as processes, Journal of Mathematical Structures in Computer Science, vol.2, issue.2, pp.119-141, 1992.

M. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I, Information and Computation, vol.100, issue.1, pp.1-77, 1992.
DOI : 10.1016/0890-5401(92)90008-4

M. Martin and M. Uller, Polymorphic types for concurrent constraints. DFKI Saarbr ucken, 1996.

J. Niehren, Funktionale Berechnung in einem uniform nebenll auugen Kalkk ul mit logischen Variablen. Doctoral Dissertation, 1994.

J. Niehren, M. Martin, and . Uller, Constraints for free in concurrent computation, Asian Computing Science Conference, 1995.
DOI : 10.1007/3-540-60688-2_43
URL : https://hal.archives-ouvertes.fr/inria-00536813

J. Niehren and G. Smolka, A connuent relational calculus for higher-order programming with constraints, 1 st International Conference on Constraints in Computational Logics, 1994.

K. Pin87-]-keshav and . Pingali, Lazy Evaluation and the Logic Variable, Proceedings of the Institute on Declarative Programming, 1987.

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, European Symposium on Programming, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

C. Pt95a-]-benjamin, D. N. Pierce, and . Turner, Concurrent objects in a process calculus, Theory and Practice of Parallel Programming, number 907 in LNCS, pp.187-215, 1995.

C. Pt95b-]-benjamin, D. N. Pierce, and . Turner, Pict: A programming language based on the picalculus . Technical report in preparation; available electronically, 1996.

]. D. San95 and . Sands, A Na ve Time Analysis and its Theory of Cost Equivalence, The Journal of Logic and Computation, p.48, 1995.

G. Smo94 and . Smolka, A foundation for concurrent constraint programming, Constraints in Computational Logics, pp.50-72, 1994.

G. Smo95a and . Smolka, An Oz primer. Oz documentation series, DFKI Saarbr ucken, 1995.

G. Smo95b and . Smolka, The Oz programming model, Current Trends in Computer Science, 1995.

S. , V. A. Saraswat, M. Rinard, and P. Panangaden, Semantic foundations of concurrent constraint programming, POPL, pp.333-352, 1991.

S. Schulte, G. Smolka, J. , and W. Urtz, Encapsulated search and constraint programming in Oz, Second Workshop on Principles and Practice of Constraint Programming, pp.134-150, 1994.
DOI : 10.1007/3-540-58601-6_96

. Vas94, T. Vasco, and . Vasconcelos, Typed concurrent objects, 8th Proceedings of the European Conference on Object Oriented Programming, pp.100-117, 1994.

W. Walker, Objects in the -calculus, Journal on Information and Computation, vol.116, pp.254-273, 1995.

Y. Yoshida, Optimal reduction in weak-??-calculus with shared environments, Proceedings of the conference on Functional programming languages and computer architecture , FPCA '93, 1993.
DOI : 10.1145/165180.165217