Full Abstraction in the Lazy Lambda Calculus, Information and Computation, vol.105, issue.2, pp.159-267, 1993. ,
DOI : 10.1006/inco.1993.1044
A type-theoretic foundation of delimited continuations. Higher-Order and Symbolic Computation, pp.403-429, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00177326
A computational interpretation of the ?µ-calculus, MFCS'98, pp.336-345, 1998. ,
Context-based proofs of termination for typed delimited-control operators, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, 2009. ,
DOI : 10.1145/1599410.1599446
An operational foundation for delimited continuations in the CPS hierarchy, Logical Methods in Computer Science, vol.1, issue.25, pp.1-39, 2005. ,
A dynamic continuation-passing style for dynamic delimited continuations, 2005. ,
Applicative Bisimulations for Delimited-Control Operators, 2012. ,
DOI : 10.1007/978-3-642-28729-9_8
URL : https://hal.archives-ouvertes.fr/hal-01399945
Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.151-160, 1990. ,
DOI : 10.1145/91556.91622
Abstract, The Journal of Symbolic Logic, vol.121, issue.01, pp.407-413, 2001. ,
DOI : 10.2307/2694930
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
Bisimilarity as a theory of functional programming, Theoretical Computer Science, vol.228, issue.1-2, pp.5-47, 1999. ,
DOI : 10.1016/S0304-3975(98)00353-3
Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996. ,
DOI : 10.1006/inco.1996.0008
A sound and complete axiomatization of delimited continuations, ICFP'03, SIGPLAN Notices, pp.177-188, 2003. ,
Relational Reasoning about Contexts, Higher Order Operational Techniques in Semantics, pp.91-135, 1998. ,
DOI : 10.7146/brics.v4i24.18950
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5332
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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.2914
Normal Form Simulation for McCarthy's Amb, MFPS'05, pp.445-465, 2005. ,
DOI : 10.1016/j.entcs.2005.11.068
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
Howe???s Method for Calculi with Passivation, CONCUR'09, number 5710 in LNCS, pp.448-462, 2009. ,
DOI : 10.1007/BF01200262
On the observational theory of the CPS-calculus: (extended abstract), ENTCS, vol.158, pp.307-330, 2006. ,
Fully abstract models of typed ??-calculi, Theoretical Computer Science, vol.4, issue.1, pp.1-22, 1977. ,
DOI : 10.1016/0304-3975(77)90053-6
Lambda Calculus Models of Programming Languages, 1968. ,
?µ-calculus: an algorithmic interpretation of classical natural deduction, LPAR'92, number 624 in LNAI, pp.190-201, 1992. ,
Environmental bisimulations for higherorder languages, LICS'07, pp.293-302, 2007. ,
DOI : 10.1145/1889997.1890002
URL : https://hal.archives-ouvertes.fr/hal-01337665
The Pi-Calculus: A Theory of Mobile Processes, 2001. ,
A complete, co-inductive syntactic theory of sequential control and state, POPL'07, SIGPLAN Notices, pp.161-172, 2007. ,
Categorical Structure of Continuation Passing Style, 1997. ,