Franco Barbanera

Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

2014

Loosening the notions of compliance and sub-behaviour in client/server systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th Interaction and Concurrency Experience, 2014

Compliance for reversible client/server interactions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third Workshop on Behavioural Types, 2014

2012

Characterisation of Strongly Normalising lambda-mu-Terms.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

2011

A Filter Model for the λμ-Calculus - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

2010

Two notions of sub-behaviour for session-based client/server systems.

[BibT_eX]

[DOI]

Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

2009

Typing Asymmetric Client-Server Interaction.

[BibT_eX]

[DOI]

Sara Capecchi

Proceedings of the Fundamentals of Software Engineering, 2009

2007

Space-aware ambients and processes.

[BibT_eX]

[DOI]

Michele Bugliesi

Vladimiro Sassone

Theor. Comput. Sci., 2007

2006

Intersection types and lambda models.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2003

A full continuous model of polymorphism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Type Assignement for Mobile Objects.

[BibT_eX]

[DOI]

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Can addresses be types? (A case study: objects with delegation).

[BibT_eX]

[DOI]

Christopher Anderson

Sophia Drossopoulou

Proceedings of the Workshop on Object Oriented Developments, 2003

Intersection Types and Computational Rules.

[BibT_eX]

[DOI]

Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003

Tailoring Filter Models.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, International Workshop, 2003

A Calculus of Bounded Capacities.

[BibT_eX]

[DOI]

Michele Bugliesi

Vladimiro Sassone

Proceedings of the Advances in Computing Science, 2003

2002

Intersection types for lambda-trees.

[BibT_eX]

[DOI]

Fer-Jan de Vries

Theor. Comput. Sci., 2002

2001

A Type Inference Algorithm for Secure Ambients.

[BibT_eX]

[DOI]

Ivano Salvo

Vladimiro Sassone

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

1999

Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, 1999

1998

Types for trees.

[BibT_eX]

Fer-Jan de Vries

Proceedings of the Programming Concepts and Methods, 1998

1997

Modularity of Strong Normalization in the Algebraic-lambda-Cube.

[BibT_eX]

[DOI]

Herman Geuvers

J. Funct. Program., 1997

The Simply-Typed Theory of Beta-Conversion has no Maximum Extension.

[BibT_eX]

[DOI]

Inf. Comput., 1997

"Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence.

[BibT_eX]

[DOI]

Massimo Schivalocchi

Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

1996

Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

A Constructive Valuation Semantics for Classical Logic.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1996

Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions.

[BibT_eX]

[DOI]

J. Funct. Program., 1996

A Symmetric Lambda Calculus for Classical Program Extraction.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 1996

1995

Intersection and Union Types: Syntax and Semantics

[BibT_eX]

[DOI]

Inf. Comput., June, 1995

A Strong Normalization Result for Classical Logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

1994

Toward A Semantics for the Quest Language.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Proof-functional connectives and realizability.

[BibT_eX]

[DOI]

Simone Martini

Arch. Math. Log., 1994

Modularity of Strong Normalization and Confluence in the algebraic-lambda-Cube

[BibT_eX]

[DOI]

Herman Geuvers

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.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1993

Extracting Constructive Content from Classical Logic via Control-like Reductions.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1993

Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the CAAP '92, 1992

1991

Intersection and Union Types.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1991

Strong Conjunction and Intersection Types.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Towards a Semantics for the QUEST Language

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990

Combining Term Rewriting and Type Assignment Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved.

[BibT_eX]

[DOI]