Jean-Marie Madiot
Jean-Marie Madiot
Verified email at cs.princeton.edu - Homepage
Title
Cited by
Cited by
Year
Bisimulations up-to: Beyond first-order transition systems
JM Madiot, D Pous, D Sangiorgi
International Conference on Concurrency Theory, 93-108, 2014
182014
Higher-order languages: dualities and bisimulation enhancements
JM Madiot
Ecole normale supérieure de lyon-ENS LYON, 2015
112015
Duality and i/o-Types in the π-Calculus
D Hirschkoff, JM Madiot, D Sangiorgi
CONCUR 2012–Concurrency Theory, 302-316, 2012
82012
Name-passing calculi: from fusions to preorders and types
D Hirschkoff, JM Madiot, D Sangiorgi
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 378-387, 2013
72013
A behavioural theory for a π-calculus with preorders
D Hirschkoff, JM Madiot, X Xian
Journal of Logical and Algebraic Methods in Programming 84 (6), 806-825, 2015
42015
Constructive axiomatic for the real numbers
JM Madiot, PM Pédrot
Coq Workshop, 2011
32011
Specification of imperative languages using operational semantics in Coq
JM Madiot
Report, slides, 2010
12010
Modular coinduction up-to for higher-order languages via first-order transition systems
JM Madiot, D Pous, D Sangiorgi
arXiv preprint arXiv:2001.07063, 2020
2020
Name-passing calculi: From fusions to preorders and types
D Hirschkoff, JM Madiot, D Sangiorgi
Information and Computation 251, 335-360, 2016
2016
On Coupled Logical Bisimulation for the Lambda-Calculus
R Kavanagh, JM Madiot
arXiv preprint arXiv:1410.2833, 2014
2014
Symmetries and dualities in name-passing process calculi
D Hirschkoff, JM Madiot, D Sangiorgi
Computing with New Resources, 307-322, 2014
2014
Duality and i/o-types in the π-calculus
JM Madiot
2012
The system can't perform the operation now. Try again later.
Articles 1–12