P. Audebaud and C. Paulin-Mohring, Proofs of randomized algorithms in Coq, in Proc. of Mathematics of Program Construction. Lect. Notes Comput. Sci. 4014 49–68 (2006).
 P.-L. Curien and H. Herbelin, The duality of computation, in Proc. of International Conference on Functional Programming (2000) 233–243.
 U. Dal Lago and M. Zorzi, Probabilistic operational semantics for the lambda calculus. Long Version. Available at http://arxiv.org/abs/1104.0195, 2012.
 Danvy, O. and Filinski, A., Representing control : A study of the CPS transformation. Math. Struct. Comput. Sci. 2 (1992) 361–391.
 Danvy, O. and Nielsen, L.R., CPS transformation of beta-redexes. Inform. Process. Lett. 94 (2005) 217–224.
 B.A. Davey and H.A. Priestley, Introduction to Lattices and Order. Cambridge University Press (2002).
 de’ Liguoro, U. and Piperno, A., Nondeterministic extensions of untyped λ-calculus. Inform. Comput. 122 (1995) 149–177.
 Di Pierro, A., Hankin, C. and Wiklicky, H., Probabilistic λ-calculus and quantitative program analysis. J. Logic Comput. 15 (2005) 159–179.
 Edalat, A., Domains for computation in mathematics, physics and exact real arithmetic. Bull. Symbolic Logic 3 (1997) 401–452.
 A. Edalat and M.H. Escard, Integration in real PCF, in Proc. of IEEE Symposium on Logic in Computer Science. Society Press (1996) 382–393.
 M. Gaboardi, Inductive and coinductive techniques in the operational analysis of functional programs : an introduction. Master’s thesis, Universita’ di Milano, Bicocca (2004).
 M. Giry, A categorical approach to probability theory, in Categorical Aspects of Topology and Analysis, edited by B. Banaschewski. Springer, Berlin, Heidelberg (1982) 68–85.
 Jacobs, B. and Rutten, J., A tutorial on (co)algebras and (co)induction. Bull. EATCS 62 (1996) 222–259.
 C. Jones, Probabilistic non-determinism. Ph.D. thesis, University of Edinburgh, Edinburgh, Scotland, UK (1989).
 C. Jones and G. Plotkin, A probabilistic powerdomain of evaluations, in Proc. of IEEE Symposium on Logic in Computer Science. IEEE Press (1989) 186–195.
 Leroy, X. and Grall, H., Coinductive big-step operational semantics. Inform. Comput. 207 (2009) 284–304.
 E. Moggi, Computational lambda-calculus and monads, in Proc. of IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press (1989) 14–23.
 Moggi, E., Notions of computation and monads. Inform. Comput. 93 (1989) 55–92.
 S. Park, A calculus for probabilistic languages, in Proc. of ACM SIGPLAN International Workshop on Types in Languages Design and Implementation. ACM Press (2003) 38–49.
 S. Park, F. Pfenning and S. Thrun, A probabilistic language based upon sampling functions, in Proc. of ACM Symposium on Principles of Programming Languages 40 (2005) 171–182.
 Plotkin, G.D., Call-by-name, call-by-value and the λ-calculus. Theoret. Comput. Sci. 1 (1975) 125–159.
 Plotkin, G.D., LCF considered as a programming language. Theoret. Comput. Sci. 5 (1977) 223–255.
 N. Ramsey and A. Pfeffer, Stochastic lambda calculus and monads of probability distributions, in Proc. of ACM Symposium on Principles of Programming Languages. ACM Press (2002) 154–165.
 Rutten, J., Elements of Stream Calculus (An Extensive Exercise In Coinduction). Electron. Notes Theor. Comput. Sci 45 (2001) 358–423.
 Saheb-Djaromi, N., Probabilistic LCF, in Proc. of International Symposium on Mathematical Foundations of Computer Science. Lect. Notes Comput. Sci. 64 (1978) 442–451.
 D. Sangiorgi, Introduction to Bisimulation and Coinduction. Cambridge University Press (2012).
 Selinger, P. and Valiron, B., A lambda calculus for quantum computation with classical control. Math. Struct. Comput. Sci. 16 (2006) 527–552.
 C. Wadsworth, Some unusual λ-calculus numeral systems, in To H.B. Curry : Essays on Combinatory Logic, Lambda Calculus and Formalism, edited by J.P. Seldin and J.R. Hindley. Academic Press (1980).