| Composition and decomposition of multiparty sessions | 0 | 0.34 | 2021 |
| Two notions of sub-behaviour for session-based client/server systems - 10 Years Later. | 0 | 0.34 | 2020 |
| Session types and subtyping for orchestrated interactions. | 0 | 0.34 | 2019 |
| Connecting open systems of communicating finite state machines. | 0 | 0.34 | 2019 |
| A theory of retractable and speculative contracts. | 0 | 0.34 | 2018 |
| Intersection Types for the lambda-mu Calculus. | 0 | 0.34 | 2018 |
| Global Types for Open Systems. | 0 | 0.34 | 2018 |
| Retractability, games and orchestrators for session contracts. | 2 | 0.37 | 2017 |
| Reversible client/server interactions. | 3 | 0.41 | 2016 |
| A Game Interpretation Of Retractable Contracts | 4 | 0.43 | 2016 |
| Sub-behaviour relations for session-based client/server systems. | 1 | 0.36 | 2015 |
| Orchestrated Session Compliance | 2 | 0.36 | 2015 |
| Retractable Contracts. | 0 | 0.34 | 2015 |
| Compliance For Reversible Client/Server Interactions | 6 | 0.45 | 2014 |
| Characterisation Of Strongly Normalising Lambda Mu-Terms | 1 | 0.36 | 2013 |
| Loosening The Notions Of Compliance And Sub-Behaviour In Client/Server Systems | 2 | 0.37 | 2013 |
| A Filter Model for the λμ-Calculus - (Extended Abstract). | 0 | 0.34 | 2011 |
| Two notions of sub-behaviour for session-based client/server systems | 28 | 0.93 | 2010 |
| Typing Asymmetric Client-Server Interaction | 2 | 0.38 | 2009 |
| Space-aware ambients and processes | 4 | 0.40 | 2007 |
| Intersection types and lambda models | 8 | 0.61 | 2006 |
| Type Assignement for Mobile Objects | 1 | 0.34 | 2004 |
| Can addresses be types? (A case study: objects with delegation) | 10 | 1.10 | 2003 |
| Tailoring Filter Models | 1 | 0.37 | 2003 |
| A full continuous model of polymorphism | 3 | 0.43 | 2003 |
| Intersection Types and Computational Rules | 12 | 0.65 | 2003 |
| A Calculus of Bounded Capacities | 11 | 0.69 | 2003 |
| Intersection types for lambda-trees | 0 | 0.34 | 2002 |
| A Type Inference Algorithm for Secure Ambients | 5 | 0.39 | 2001 |
| Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule | 2 | 0.37 | 1999 |
| Types for trees | 3 | 0.42 | 1998 |
| The simply typed theory of &bgr;-conversion has no maximum extension | 0 | 0.34 | 1997 |
| "Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence | 3 | 0.43 | 1997 |
| Modularity of strong normalization in the algebraic-λ-cube | 5 | 0.47 | 1997 |
| A Constructive Valuation Semantics for Classical Logic | 0 | 0.34 | 1996 |
| Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization | 3 | 0.38 | 1996 |
| Intersection type assignment systems with higher-order algebraic rewriting | 9 | 1.11 | 1996 |
| Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions | 5 | 0.88 | 1996 |
| A strong normalization result for classical logic | 2 | 0.41 | 1995 |
| Intersection and union types: syntax and semantics | 61 | 3.56 | 1995 |
| Modularity of strong normalization and confluence in the algebraic-λ-cube | 13 | 0.70 | 1994 |
| Proof-functional connectives and realizability | 3 | 0.49 | 1994 |
| A symmetric lambda calculus for classical program extraction | 46 | 3.48 | 1994 |
| Extracting Constructive Content from Classical Logic via Control-like Reductions | 25 | 2.51 | 1993 |
| Combining First and Higher Order Rewrite Systems with Type Assignment Systems | 18 | 0.82 | 1993 |
| Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega | 4 | 0.47 | 1993 |
| A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction | 4 | 1.35 | 1992 |
| Strong Conjunction And Intersection Types | 12 | 1.66 | 1991 |
| Intersection and Union Types | 15 | 0.79 | 1991 |
| Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved | 10 | 0.70 | 1990 |
