G. Agha, ACTORS: A Model of Concurrent Computation in Distributed Systems, 1986.

Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler, A call-by-need lambda calculus, Proc. POPL, pp.233-246, 1995.

G. Boudol, Asynchrony and the -calculus (note), 1992.

S. Brook and G. Ostheimer, Process semantics of graph reduction, Proc. CONCUR, pp.238-252, 1995.
DOI : 10.1007/3-540-60218-6_36

F. S. De-boer and C. Palamidessi, A process algebra of concurrent constraint programming, Proc. JICSLP, pp.463-477, 1992.

M. Falaschi, M. Gabbrielli, and C. Palamidessi, Compositional analysis for concurrent constraint programming, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.210-220, 1993.
DOI : 10.1109/LICS.1993.287586

M. Henz, G. Smolka, and J. W. Urtz, Object-Oriented Concurrent Constraint Programming in Oz, Principles and Practice of Constraint Programming, pp.27-48, 1995.

K. Honda and N. Yoshida, On Reduction-Based Semantics, Proc. FST-TCS, 1993.

J. W. Klop, Term Rewriting Systems, pp.2-116, 1992.

M. Mehl, R. Scheidhauer, and C. Schulte, An abstract machine for Oz, Proc. PLILP
DOI : 10.1007/BFb0026819

R. Milner, The Polyadic ??-Calculus: a Tutorial, Proc. 1991 Marktoberndorf Summer School on Logic and Algebra of Speciication. NATO ASI Series, 1993.
DOI : 10.1007/978-3-642-58041-3_6

R. Milner, Functions as processes, Mathematical Structures in Computer Science, vol.4, issue.02, pp.119-141, 1992.
DOI : 10.1016/0304-3975(87)90045-4

URL : https://hal.archives-ouvertes.fr/inria-00075405

R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes, I and II. Information and Computation, pp.1-40, 1992.

T. , K. Popow, C. Schulte, and J. W. Urtz, Constraint programming in Oz. DFKI Oz documentation series, DFKI Saarbr ucken, Germany, 1994. Documentation and System

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

J. Niehren, Functional computation as concurrent computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, 1995.
DOI : 10.1145/237721.237801

URL : https://hal.archives-ouvertes.fr/inria-00536819

J. Niehren, M. Martin, and . Uller, Constraints for free in concurrent computation, Research Report German Research Center for Artiicial Intelligence (DFKI), 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, Proc. CCL, pp.89-104, 1994.

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

V. A. Saraswat, M. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-352, 1991.
DOI : 10.1145/99583.99627

G. Smolka, A Calculus for Higher-Order Concurrent Constraint Programming with Deep Guards, 1994.

G. Smolka, A Foundation for Concurrent Constraint Programming, Proc. CCL, pp.50-72, 1994.

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

G. Smolka, The Deenition of Kernel Oz, Constraints: Basics and Trends, 1995.