Franco Barbanera

Orcid: 0000-0002-8039-1085

According to our database1, Franco Barbanera authored at least 68 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Composition of synchronous communicating systems.
J. Log. Algebraic Methods Program., October, 2023

A Theory of Formal Choreographic Languages.
Log. Methods Comput. Sci., 2023

Partially Typed Multiparty Sessions.
Proceedings of the Proceedings 16th Interaction and Concurrency Experience, 2023

Multicompatibility for Multiparty-Session Composition.
Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

2022
On Composing Communicating Systems.
Proceedings of the Proceedings 15th Interaction and Concurrency Experience, 2022

On Formal Choreographic Modelling: A Case Study in EU Business Processes.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles, 2022

Open Compliance in Multiparty Sessions.
Proceedings of the Formal Aspects of Component Software - 18th International Conference, 2022

Formal Choreographic Languages.
Proceedings of the Coordination Models and Languages, 2022

2021
Composition and decomposition of multiparty sessions.
J. Log. Algebraic Methods Program., 2021

Composition of choreography automata.
CoRR, 2021

Corinne, a Tool for Choreography Automata.
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

2020
Two notions of sub-behaviour for session-based client/server systems: 10 Years Later.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

Composing Communicating Systems, Synchronously.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles, 2020

Choreography Automata.
Proceedings of the Coordination Models and Languages, 2020

2019
Session types and subtyping for orchestrated interactions.
J. Log. Algebraic Methods Program., 2019

Connecting open systems of communicating finite state machines.
J. Log. Algebraic Methods Program., 2019

Open Multiparty Sessions.
Proceedings of the Proceedings 12th Interaction and Concurrency Experience, 2019

2018
A theory of retractable and speculative contracts.
Sci. Comput. Program., 2018

Intersection Types for the lambda-mu Calculus.
Log. Methods Comput. Sci., 2018

Global Types for Open Systems.
Proceedings of the Proceedings 11th Interaction and Concurrency Experience, 2018

2017
Retractability, games and orchestrators for session contracts.
Log. Methods Comput. Sci., 2017

Orchestrated session compliance.
J. Log. Algebraic Methods Program., 2017

Session Types for Orchestrated Interactions.
Proceedings of the Proceedings 10th Interaction and Concurrency Experience, 2017

Retractable and Speculative Contracts.
Proceedings of the Coordination Models and Languages, 2017

2016
Reversible client/server interactions.
Formal Aspects Comput., 2016

A Game Interpretation of Retractable Contracts.
Proceedings of the Coordination Models and Languages, 2016

2015
Sub-behaviour relations for session-based client/server systems.
Math. Struct. Comput. Sci., 2015

Retractable Contracts.
Proceedings of the Proceedings Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2015

2014
Loosening the notions of compliance and sub-behaviour in client/server systems.
Proceedings of the Proceedings 7th Interaction and Concurrency Experience, 2014

Compliance for reversible client/server interactions.
Proceedings of the Proceedings Third Workshop on Behavioural Types, 2014

2012
Characterisation of Strongly Normalising lambda-mu-Terms.
Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

2011
A Filter Model for the <i>λμ</i>-Calculus - (Extended Abstract).
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

2010
Two notions of sub-behaviour for session-based client/server systems.
Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

2009
Typing Asymmetric Client-Server Interaction.
Proceedings of the Fundamentals of Software Engineering, 2009

2007
Space-aware ambients and processes.
Theor. Comput. Sci., 2007

2006
Intersection types and lambda models.
Theor. Comput. Sci., 2006

2003
A full continuous model of polymorphism.
Theor. Comput. Sci., 2003

Type Assignement for Mobile Objects.
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Can addresses be types? (A case study: objects with delegation).
Proceedings of the Workshop on Object Oriented Developments, 2003

Intersection Types and Computational Rules.
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003

Tailoring Filter Models.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

A Calculus of Bounded Capacities.
Proceedings of the Advances in Computing Science, 2003

2002
Intersection types for lambda-trees.
Theor. Comput. Sci., 2002

2001
A Type Inference Algorithm for Secure Ambients.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

1999
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and <i>beta</i>-Rule.
Proceedings of the Types for Proofs and Programs, 1999

1998
Types for trees.
Proceedings of the Programming Concepts and Methods, 1998

1997
Modularity of Strong Normalization in the Algebraic-lambda-Cube.
J. Funct. Program., 1997

The Simply-Typed Theory of Beta-Conversion has no Maximum Extension.
Inf. Comput., 1997

"Classical" Programming-with-Proofs in lambda<sub>PA</sub><sup>Sym</sup>: An Analysis of Non-confluence.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

1996
Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting.
Theor. Comput. Sci., 1996

A Constructive Valuation Semantics for Classical Logic.
Notre Dame J. Formal Log., 1996

Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions.
J. Funct. Program., 1996

A Symmetric Lambda Calculus for Classical Program Extraction.
Inf. Comput., 1996

Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization.
Proceedings of the Programming Languages and Systems, 1996

1995
Intersection and Union Types: Syntax and Semantics
Inf. Comput., June, 1995

A Strong Normalization Result for Classical Logic.
Ann. Pure Appl. Log., 1995

1994
Toward A Semantics for the Quest Language.
RAIRO Theor. Informatics Appl., 1994

Proof-functional connectives and realizability.
Arch. Math. Log., 1994

Modularity of Strong Normalization and Confluence in the algebraic-lambda-Cube
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
Combining First and Higher Order Rewrite Systems with Type Assignment Systems.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Extracting Constructive Content from Classical Logic via Control-like Reductions.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction.
Proceedings of the CAAP '92, 1992

1991
Intersection and Union Types.
Proceedings of the Theoretical Aspects of Computer Software, 1991

Strong Conjunction and Intersection Types.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Towards a Semantics for the QUEST Language
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990
Combining Term Rewriting and Type Assignment Systems.
Int. J. Found. Comput. Sci., 1990

Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved.
Proceedings of the Conditional and Typed Rewriting Systems, 1990


  Loading...