, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, vol.105, issue.2, pp.159-267, 1993.
DOI : 10.1006/inco.1993.1044
, Environmental bisimulations for delimitedcontrol operators with dynamic prompt generation, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016), volume 52 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.1-9
, The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundation of Mathematics, 1984.
, Normal Form Bisimulations for Delimited-Control Operators, Functional and Logic Programming, 13th International Symposium (FLOPS'12), pp.47-61, 2012.
DOI : 10.1007/978-3-642-29822-6_7
URL : https://hal.archives-ouvertes.fr/hal-01399951
, Bisimulations for delimited-control operators Avalaible at https, 2015.
DOI : 10.1007/978-3-642-28729-9_8
URL : http://arxiv.org/pdf/1201.0874.pdf
, Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.151-160, 1990.
DOI : 10.1145/91556.91622
, Representing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.446-457, 1994.
DOI : 10.1145/174675.178047
, Axioms for control operators in the CPS hierarchy. Higher-Order and Symbolic Computation, pp.339-369, 2007.
, Bisimulation for pure untyped ?µ-caluclus (extended abstract) Unpublished note, 1999.
, Bisimulation in Untyped Lambda Calculus:, Proceedings of the 15th Annual Conference on Mathematical Foundations of Programming Semantics, pp.346-374, 1999.
DOI : 10.1016/S1571-0661(04)80083-5
URL : https://doi.org/10.1016/s1571-0661(04)80083-5
, Eager Normal Form Bisimulation, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.345-354, 2005.
DOI : 10.1109/LICS.2005.15
URL : http://www.cs.bham.ac.uk/~pbl/papers/LassenLevy2007tnfb-4.pdf
, Normal Form Simulation for McCarthy's Amb, Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI), pp.445-465, 2005.
DOI : 10.1016/j.entcs.2005.11.068
URL : https://doi.org/10.1016/j.entcs.2005.11.068
, Head normal form bisimulation for pairs and the ?µ-calculus, Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pp.297-306, 2006.
DOI : 10.1109/lics.2006.29
, Typed Normal Form Bisimulation, Computer Science Logic, CSL'07, pp.283-297, 2007.
DOI : 10.1007/978-3-540-74915-8_23
URL : http://www.cs.bham.ac.uk/~pbl/papers/LassenLevy2007tnfb-4.pdf
, Typed Normal Form Bisimulation for Parametric Polymorphism, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.341-352, 2008.
DOI : 10.1109/LICS.2008.26
, Bisimulations Up-to: Beyond First-Order Transition Systems, 25th International Conference on Concurrency Theory, pp.93-108, 2014.
DOI : 10.1007/978-3-662-44584-6_8
URL : https://hal.archives-ouvertes.fr/hal-00990859
, Higher-Order Languages: Dualities and Bisimulation Enhancements, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01141067
, Lambda Calculus Models of Programming Languages, 1968.
, Enhancements of the bisimulation proof method, Advanced Topics in Bisimulation and Coinduction, pp.233-289, 2011.
DOI : 10.1017/CBO9780511792588.007
URL : https://hal.archives-ouvertes.fr/hal-00909391
, The lazy lambda calculus in a concurrency scenario, Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science (LICS'92), pp.102-109, 1992.
, Environmental bisimulations for higher-order languages, Proceedings of the 22nd IEEE Symposium on Logic in Computer Science, pp.293-302, 2007.
DOI : 10.1109/lics.2007.17
URL : https://hal.archives-ouvertes.fr/hal-01337665
, A complete, co-inductive syntactic theory of sequential control and state