| Non-Deterministic Abstract Machines | 0 | 0.34 | 2022 |
| Ho Pi In Coq | 0 | 0.34 | 2021 |
| Skeletal Semantics and their Interpretations. | 0 | 0.34 | 2019 |
| JSExplain: A Double Debugger for JavaScript. | 0 | 0.34 | 2018 |
| Fully abstract encodings of λ-calculus in HOcore through abstract machines | 0 | 0.34 | 2017 |
| Efficiently Deciding μ-Calculus with Converse over Finite Trees | 4 | 0.42 | 2015 |
| Expressive logical combinators for free | 2 | 0.37 | 2015 |
| Certified Abstract Interpretation with Pretty-Big-Step Semantics | 3 | 0.40 | 2015 |
| Pretty-big-step-semantics-based Certified Abstract Interpretation. | 0 | 0.34 | 2014 |
| De la KAM avec un Processus d'Ordre Supe'rieur. | 0 | 0.34 | 2014 |
| A trusted mechanised JavaScript specification | 30 | 1.15 | 2014 |
| The effectiveness of Junior Companies from the viewpoint of engineering students at a Brazilian University | 0 | 0.34 | 2014 |
| Pretty-Big-Step-Semantics-Based Certified Abstract Interpretation (Preliminary Version) | 1 | 0.35 | 2013 |
| Concurrent flexible reversibility | 4 | 0.46 | 2013 |
| Query reasoning on trees with types, interleaving, and counting | 11 | 0.72 | 2011 |
| Characterizing contextual equivalence in calculi with passivation | 6 | 0.43 | 2011 |
| On the expressiveness and decidability of higher-order process calculi | 36 | 1.21 | 2011 |
| On the Count of Trees | 0 | 0.34 | 2010 |
| A Tree Logic with Graded Paths and Nominals | 0 | 0.34 | 2010 |
| On the expressiveness of polyadic and synchronous communication in higher-order process calculi | 16 | 0.62 | 2010 |
| JFLA 2009, Vingtièmes Journées Francophones des Langages Applicatifs, Saint Quentin sur Isère, France, January 31 - February 3, 2009. Proceedings | 9 | 1.51 | 2009 |
| On the Expressiveness of Polyadicity in Higher-Order Process Calculi. | 0 | 0.34 | 2009 |
| Typing Component-Based Communication Systems | 4 | 0.44 | 2009 |
| Typing communicating component assemblages | 3 | 0.39 | 2008 |
| Oz/K: a kernel language for component-based open programming | 11 | 0.54 | 2007 |
| Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem | 162 | 6.20 | 2007 |
| A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice | 8 | 0.62 | 2007 |
| Efficient static analysis of XML paths and types | 51 | 2.36 | 2007 |
| XPath Typing Using a Modal Logic with Converse for Finite Trees | 0 | 0.34 | 2007 |
| XTATIC | 0 | 0.34 | 2006 |
| Agreeing to agree: conflict resolution for optimistically replicated data | 3 | 0.48 | 2006 |
| Component-oriented programming with sharing: containment is not ownership | 5 | 0.42 | 2005 |
| The kell calculus: a family of higher-order distributed process calculi | 55 | 2.04 | 2004 |
| A component-based approach to distributed system management: a use case with self-manageable J2EE clusters | 4 | 0.82 | 2004 |
| The m-calculus: a higher-order distributed process calculus | 41 | 1.56 | 2003 |
| JoCaml: A Language for Concurrent Distributed and Mobile Programming | 28 | 1.33 | 2002 |
| Safe Dynamic Binding in the Join Calculus | 9 | 0.58 | 2002 |
| An Asynchronous, Distributed Implementation of Mobile Ambients | 41 | 1.71 | 2000 |
