Research Topics in Functional Programming, pp.65-117, 1990. ,
Domain theory. In: Handbook of Logic in Computer Science, pp.1-168, 1994. ,
Full abstraction in the lazy lambda calculus, Inf. Comput, vol.105, issue.2, pp.159-267, 1993. ,
An indexed model of recursive types for foundational proof-carrying code, ACM Trans. Program. Lang. Syst, vol.23, issue.5, pp.657-683, 2001. ,
The lambda calculus: its syntax and semantics. Studies in logic and the foundations of mathematics, 1984. ,
Relational algebras, Lect. Notes Math, vol.137, pp.39-55, 1970. ,
Programming with algebraic effects and handlers, J. Log. Algebr. Meth. Program, vol.84, issue.1, pp.108-123, 2015. ,
Relational semantics for effect-based program transformations: higher-order store, Proc. of PPDP, pp.301-312, 2009. ,
Proving soundness of extensional normalform bisimilarities, Electr. Notes Theor. Comput. Sci, vol.336, pp.41-56, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01650000
Step-indexed logical relations for probability, Proc. of FOSSACS 2015, pp.279-294, 2015. ,
Alcune proprietà delle forme ??-normali del ?k-calcolo. Pubblicazioni dell'Istituto per le Applicazioni del Calcolo, vol.696, 1968. ,
A course in universal algebra. Graduate texts in mathematics, 1981. ,
On probabilistic applicative bisimulation and call-byvalue lambda-calculi, Proc. of ESOP, pp.209-228, 2014. ,
Contextual equivalence for probabilistic programs with continuous random variables and scoring, Proceedings of ESOP 2017, pp.368-392, 2017. ,
Effectful applicative bisimilarity: Monads, relators, and howe's method, Proc. of LICS 2017, pp.1-12, 2017. ,
On coinductive equivalences for higherorder probabilistic functional programs, Proc. of POPL, pp.297-308, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01091573
Probabilistic operational semantics for the lambda calculus, RAIRO -Theor. Inf. and Applic, vol.46, issue.3, pp.413-450, 2012. ,
Probabilistic game semantics, ACM Transactions on Computational Logic, vol.3, issue.3, pp.359-382, 2002. ,
Introduction to lattices and order, 1990. ,
Non deterministic extensions of untyped lambdacalculus, Inf. Comput, vol.122, issue.2, pp.149-177, 1995. ,
Eager functions as processes, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, pp.364-373, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01917255
The revised report on the syntactic theories of sequential control and state, Theor. Comput. Sci, vol.103, issue.2, pp.235-271, 1992. ,
Quantitative behavioural reasoning for higher-order effectful programs: Applicative distances, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, pp.452-461, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01926069
Initial algebra semantics and continuous algebras, J. ACM, vol.24, issue.1, pp.68-95, 1977. ,
Logical relations for monadic types, Mathematical Structures in Computer Science, vol.18, issue.6, pp.1169-1217, 2008. ,
, Monoidal Topology. A Categorical Approach to Order, Metric, and Topology. No. 153 in Encyclopedia of Mathematics and its Applications, 2014.
Simulations in coalgebra, Theor. Comput. Sci, vol.327, issue.1-2, pp.71-108, 2004. ,
Combining effects: Sum and tensor, Theor. Comput. Sci, vol.357, issue.1-3, pp.70-99, 2006. ,
The category theoretic understanding of universal algebra: Lawvere theories and monads, Electr. Notes Theor. Comput. Sci, vol.172, pp.437-458, 2007. ,
A generic operational metatheory for algebraic effects, Proc. of LICS 2010, pp.209-218, 2010. ,
Probabilistic non-determinism, 1990. ,
, Foundations of Software Science and Computation Structures -16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, pp.145-160, 2013.
From applicative to environmental bisimulation, Electr. Notes Theor. Comput. Sci, vol.276, pp.215-235, 2011. ,
Bisimulation through probabilistic testing, Proceedings of POPL 1989, pp.344-352, 1989. ,
Relational reasoning about contexts, Higher Order Operational Techniques in Semantics, pp.91-136, 1998. ,
Relational Reasoning about Functions and Nondeterminism, 1998. ,
Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context, Electr. Notes Theor. Comput. Sci, vol.20, pp.346-374, 1999. ,
Eager normal form bisimulation, Proceedings of LICS 2005, pp.345-354, 2005. ,
Normal form simulation for mccarthy's amb, Electr. Notes Theor. Comput. Sci, vol.155, pp.445-465, 2006. ,
Functorial Semantics of Algebraic Theories, 2004. ,
Probabilistic böhm trees and probabilistic separation, Proc. of LICS, 2018. ,
An algebraic interpretation of the lambda beta -calculus and a labeled lambda -calculus, Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in, pp.147-165, 1975. ,
Similarity quotients as final coalgebras, Proc. of FOSSACS 2011, vol.6604, pp.27-41, 2011. ,
Modelling environments in call-by-value programming languages, Inf. Comput, vol.185, issue.2, pp.182-210, 2003. ,
Set-theoretical models of lambda calculus: Theories, expansions, isomorphisms, Annals of Pure and Applied Logic, vol.24, pp.153-188, 1983. ,
Categories for the Working Mathematician, 1971. ,
Equivalence in functional languages with effects, J. Funct. Program, vol.1, issue.3, pp.287-327, 1991. ,
Functions as processes, Mathematical Structures in Computer Science, vol.2, issue.2, pp.119-141, 1992. ,
URL : https://hal.archives-ouvertes.fr/inria-00075405
Computational lambda-calculus and monads, Proc. of LICS 1989, pp.14-23, 1989. ,
Notions of computation and monads, Inf. Comput, vol.93, issue.1, pp.55-92, 1991. ,
Lambda Calculus Models of Programming Languages, 1969. ,
Non-determinism in a functional setting, Proc. of LICS, pp.275-286, 1993. ,
The Lazy Lambda Calculus: An Investigation Into the Foundations of Functional Programming, 1988. ,
Call-by-name, call-by-value and the lambda-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975. ,
, Lambda-definability and logical relations, 1973.
Adequacy for algebraic effects, Proc. of FOSSACS, pp.1-24, 2001. ,
Notions of computation determine monads, Proc. of FOSSACS, pp.342-356, 2002. ,
Algebraic operations and generic effects, Applied Categorical Structures, vol.11, issue.1, pp.69-94, 2003. ,
Handling algebraic effects, Logical Methods in Computer Science, vol.9, issue.4, 2013. ,
Enhancements of the bisimulation proof method, Advanced Topics in Bisimulation and Coinduction, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00909391
Types, abstraction and parametric polymorphism, IFIP Congress, pp.513-523, 1983. ,
Improvement theory and its applications, Higher Order Operational Techniques in Semantics, pp.275-306, 1998. ,
Environmental bisimulations for higherorder languages, ACM Trans. Program. Lang. Syst, vol.33, issue.1, pp.1-5, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01337665
A theory of bisimulation for the pi-calculus, CONCUR '93, 4th International Conference on Concurrency Theory, pp.127-142, 1993. ,
The lazy lambda calculus in a concurrency scenario, Inf. Comput, vol.111, issue.1, pp.120-153, 1994. ,
Environmental bisimulations for probabilistic higherorder languages, Proceedings of POPL 2016, pp.595-607, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01337665
Behavioural equivalence via modalities for algebraic effects, Proc. of ESOP, pp.300-326, 2018. ,
A complete, co-inductive syntactic theory of sequential control and state, Proceedings of POPL 2007, pp.161-172, 2007. ,
The existence of probability measures with given marginals, Ann. Math. Statist, vol.36, issue.2, pp.423-439, 1965. ,
A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math, vol.5, issue.2, pp.285-309, 1955. ,
Simulation and fixpoint semantics, Rijksuniversiteit Groningen, 1996. ,
, Optimal Transport: Old and New. Grundlehren der mathematischen Wissenschaften, 2008.
Proceedings of the NATO Advanced Study Institute on Program Design Calculi, Marktoberdorf, Program Design Calculi, pp.233-264, 1992. ,