Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991. ,
DOI : 10.1016/0304-3975(86)90035-6
The call-by-need lambda calculus, Journal of functional programming, vol.7, issue.3, 1997. ,
A call-by-need lambda calculus, Pages 233?246 of: ACM symposium on principles of programming languages, 1995. ,
Concurrent Programing in Erlang, 1996. ,
I-structures: Data-structures for parallel computing, ACM transactions on programming languages and systems, vol.4, issue.11, pp.598-632, 1989. ,
The lambda calculus. Its syntax and semantics, Studies in Logic and the Foundations of Mathematics, 1981. ,
Asynchrony and the ?-calculus (note) Rapport de Recherche 1702, 1992. ,
Process semantics of graph reduction, 1995. ,
DOI : 10.1007/3-540-60218-6_36
Rewrite Systems, Chap, vol.6, pp.243-320, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50011-1
The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, 1996. ,
DOI : 10.1145/237721.237805
Join Calculus Language, INRIA Rocquencourt, 1997. ,
DOI : 10.1007/3-540-45699-6_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.4788
An object calculus for asynchronous communication, European conference on objectoriented programming, 1991. ,
DOI : 10.1007/BFb0057019
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
A fully abstract semantics for concurrent graph reduction, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 1994. ,
DOI : 10.1109/LICS.1994.316084
Term rewriting systems: A tutorial. Bulletin of the European association on theoretical computer sience, pp.143-182, 1987. ,
A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, 1993. ,
DOI : 10.1145/158511.158618
Logic semantics for a class of committed-choice programs. Pages 858, 4 th international conference on logic programming, 1987. ,
Call-byname , call-by-value, call-by-need, and the linear lambda calculus, 11 th international conference on the mathematical foundations of programming semantics, 1995. ,
The call-by-need lambda calculus, Journal of Functional Programming, vol.8, issue.3, pp.275-317, 1998. ,
DOI : 10.1017/S0956796898003037
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, 1990. ,
DOI : 10.1145/99583.99618
La Stategie Paresseuse, Thèse doctorale, 1992. ,
The Polyadic ??-Calculus: a Tutorial, 1991. ,
DOI : 10.1007/978-3-642-58041-3_6
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
Improvement in a lazy context, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, 1999. ,
DOI : 10.1145/292540.292547
On Determinacy and Nondeterminacy in Concurrent Programming . Dissertation, technische Fakultät, 1996. ,
Decoding choice encodings. Pages 179? 194 of: Montanari, 7 th international conference on concurrency theory, 1996. ,
DOI : 10.1007/3-540-61604-7_55
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5996
Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen. Dissertation, 1994. ,
Functional computation as concurrent computation Uniform confluence in concurrent computation, unabridged, Pages 333?343 of: 23 th ACM symposium on principles of programming languages, p.99, 1996. ,
Constraints for Free in Concurrent Computation . Pages 171?186 of: Kanchanasut Asian computing science conference, Lecture Notes in Computer Science, issue.1023, 1995. ,
URL : https://hal.archives-ouvertes.fr/inria-00536813
A confluent relational calculus for higherorder programming with constraints. Pages 89?104 of: 1 st international conference on constraints in computational logics, Lecture Notes in Computer Science, vol.845, 1994. ,
URL : https://hal.archives-ouvertes.fr/inria-00536826
On confluence in the ??-calculus, Pages 314?324 of: International conference on automata, languages, and programming, 1997. ,
DOI : 10.1007/3-540-63165-8_188
Pict: A Programming Language Based on the Pi-Calculus, 1997. ,
Lazy evaluation and the logic variable, Proceedings of the 2nd international conference on Supercomputing , ICS '88, 1987. ,
DOI : 10.1145/55364.55419
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
An adequate operational semantics of sharing in lazy evaluation, European symposium on programming, 1992. ,
DOI : 10.1007/3-540-55253-7_26
Concurrent ML: Design, Application and Semantics. Pages 165?198 of: Functional programming, concurrency, simulation and automated reasoning, Lecture Notes in Computer Science, vol.693, 1992. ,
DOI : 10.1007/3-540-56883-2_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7965
A Theory of Bisimulation for ?-Calculus, Acta informatica, p.33, 1996. ,
The name discipline of uniform receptiveness, Pages 303?313 of: International conference on automata, languages, and programming, 1997. ,
DOI : 10.1016/S0304-3975(99)00040-7
The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, 1991. ,
DOI : 10.1145/99583.99627
A foundation for concurrent constraint programming. Pages 50?72 of: 1 st international conference on constraints in computational logics, Lecture Notes in Computer Science, vol.845, 1994. ,
The Oz programming model Pages 324?343 of: van Leeuwen, Computer science today, 1995. ,
The Oz Programming System Programming Systems Lab, 1995. ,
Facile Antigua release programming guide, 1993. ,
The polymorphic pi-calculus: Theory and implementation, 1996. ,
Constraints as Processes. Pages 389?405 of, 7 th international conference on concurrency theory. Lecture Notes in Computer Science, no. 1119, 1996. ,
DOI : 10.1007/3-540-61604-7_66
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7892
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