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
Computational lambda-calculus and monads, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 1988. ,
DOI : 10.1109/LICS.1989.39155
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2787
Reasoning about programs in continuation-passing style, Lisp and Symbolic Computation, vol.6, pp.3-4, 1993. ,
Sound and complete axiomatisations of call-by-value control operators, Mathematical Structures in Computer Science, vol.10, issue.04, pp.461-482, 1995. ,
DOI : 10.1007/BF01019462
From Böhm's theorem to observational equivalences: an informal account, Electr. Notes Theor. Comput. Sci, vol.50, issue.2, 2001. ,
The duality of computation, Proceedings of ICFP 2000, pp.233-243, 2000. ,
DOI : 10.1145/357766.351262
URL : https://hal.archives-ouvertes.fr/inria-00156377
C'est maintenant qu'on calcule: au coeur de la dualité, 2005. ,
Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210405, 1935. ,
DOI : 10.1007/BF01201353
Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction, International Conference LPAR '92 Proceedings, pp.190-201, 1992. ,
Une ??quivalence sur les lambda- termes, Theoretical Computer Science, vol.126, issue.2, pp.281-292, 1994. ,
DOI : 10.1016/0304-3975(94)90012-4
URL : http://doi.org/10.1016/0304-3975(94)90012-4
A reflection on call-by-value, ACM Transactions on Programming Languages and Systems, vol.19, issue.6, pp.916-941, 1997. ,
DOI : 10.1145/267959.269968
Control reduction theories: the benefit of structural substitution, Journal of Functional Programming, vol.18, issue.03, pp.373-419, 2008. ,
DOI : 10.1145/317636.317779
URL : https://hal.archives-ouvertes.fr/inria-00177320
Abstract, The Journal of Symbolic Logic, vol.121, issue.01, pp.407-413, 2001. ,
DOI : 10.2307/2694930