| 2007 |
|---|
| 34 | EE | Franco Barbanera,
Michele Bugliesi,
Mariangiola Dezani-Ciancaglini,
Vladimiro Sassone:
Space-aware ambients and processes.
Theor. Comput. Sci. 373(1-2): 41-69 (2007) |
| 2006 |
|---|
| 33 | EE | Fabio Alessi,
Franco Barbanera,
Mariangiola Dezani-Ciancaglini:
Intersection types and lambda models.
Theor. Comput. Sci. 355(2): 108-126 (2006) |
| 2004 |
|---|
| 32 | EE | Franco Barbanera,
Ugo de'Liguoro:
Type Assignement for Mobile Objects.
Electr. Notes Theor. Comput. Sci. 104: 25-38 (2004) |
| 2003 |
|---|
| 31 | EE | Franco Barbanera,
Michele Bugliesi,
Mariangiola Dezani-Ciancaglini,
Vladimiro Sassone:
A Calculus of Bounded Capacities.
ASIAN 2003: 205-223 |
| 30 | EE | Fabio Alessi,
Franco Barbanera,
Mariangiola Dezani-Ciancaglini:
Tailoring Filter Models.
TYPES 2003: 17-33 |
| 29 | EE | Christopher Anderson,
Franco Barbanera,
Mariangiola Dezani-Ciancaglini,
Sophia Drossopoulou:
Can addresses be types? (A case study: objects with delegation).
Electr. Notes Theor. Comput. Sci. 82(7): (2003) |
| 28 | EE | Fabio Alessi,
Franco Barbanera,
Mariangiola Dezani-Ciancaglini:
Intersection Types and Computational Rules.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
| 27 | | Franco Barbanera,
Stefano Berardi:
A full continuous model of polymorphism.
Theor. Comput. Sci. 290(1): 407-428 (2003) |
| 2002 |
|---|
| 26 | EE | Steffen van Bakel,
Franco Barbanera,
Mariangiola Dezani-Ciancaglini,
Fer-Jan de Vries:
Intersection types for lambda-trees.
Theor. Comput. Sci. 272(1-2): 3-40 (2002) |
| 2001 |
|---|
| 25 | EE | Franco Barbanera,
Mariangiola Dezani-Ciancaglini,
Ivano Salvo,
Vladimiro Sassone:
A Type Inference Algorithm for Secure Ambients.
Electr. Notes Theor. Comput. Sci. 62: (2001) |
| 1999 |
|---|
| 24 | EE | Steffen van Bakel,
Franco Barbanera,
Maribel Fernández:
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule.
TYPES 1999: 41-60 |
| 1998 |
|---|
| 23 | | Franco Barbanera,
Mariangiola Dezani-Ciancaglini,
Fer-Jan de Vries:
Types for trees.
PROCOMET 1998: 11-29 |
| 1997 |
|---|
| 22 | | Franco Barbanera,
Stefano Berardi,
Massimo Schivalocchi:
"Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence.
TACS 1997: 365-390 |
| 21 | | Franco Barbanera,
Stefano Berardi:
The Simply-Typed Theory of Beta-Conversion has no Maximum Extension.
Inf. Comput. 139(1): 57-61 (1997) |
| 20 | | Franco Barbanera,
Maribel Fernández,
Herman Geuvers:
Modularity of Strong Normalization in the Algebraic-lambda-Cube.
J. Funct. Program. 7(6): 613-660 (1997) |
| 1996 |
|---|
| 19 | | Steffen van Bakel,
Franco Barbanera,
Maribel Fernández:
Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization.
ESOP 1996: 387-403 |
| 18 | | Franco Barbanera,
Stefano Berardi:
A Symmetric Lambda Calculus for Classical Program Extraction.
Inf. Comput. 125(2): 103-117 (1996) |
| 17 | | Franco Barbanera,
Stefano Berardi:
Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions.
J. Funct. Program. 6(3): 519-525 (1996) |
| 16 | | Franco Barbanera,
Stefano Berardi:
A Constructive Valuation Semantics for Classical Logic.
Notre Dame Journal of Formal Logic 37(3): 462-482 (1996) |
| 15 | EE | Franco Barbanera,
Maribel Fernández:
Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting.
Theor. Comput. Sci. 170(1-2): 173-207 (1996) |
| 1995 |
|---|
| 14 | | Franco Barbanera,
Stefano Berardi:
A Strong Normalization Result for Classical Logic.
Ann. Pure Appl. Logic 76(2): 99-116 (1995) |
| 13 | | Franco Barbanera,
Mariangiola Dezani-Ciancaglini,
Ugo de'Liguoro:
Intersection and Union Types: Syntax and Semantics
Inf. Comput. 119(2): 202-230 (1995) |
| 1994 |
|---|
| 12 | | Franco Barbanera,
Maribel Fernández,
Herman Geuvers:
Modularity of Strong Normalization and Confluence in the algebraic-lambda-Cube
LICS 1994: 406-415 |
| 11 | | Franco Barbanera,
Stefano Berardi:
A Symmetric Lambda Calculus for "Classical" Program Extraction.
TACS 1994: 495-515 |
| 10 | | Fabio Alessi,
Franco Barbanera:
Toward A Semantics for the Quest Language.
ITA 28(6): 513-555 (1994) |
| 1993 |
|---|
| 9 | | Franco Barbanera,
Maribel Fernández:
Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega.
ICALP 1993: 657-668 |
| 8 | | Franco Barbanera,
Stefano Berardi:
Extracting Constructive Content from Classical Logic via Control-like Reductions.
TLCA 1993: 45-59 |
| 7 | | Franco Barbanera,
Maribel Fernández:
Combining First and Higher Order Rewrite Systems with Type Assignment Systems.
TLCA 1993: 60-74 |
| 1992 |
|---|
| 6 | | Franco Barbanera,
Stefano Berardi:
A Constructive Valuation Interpretation for Classical Logic and its Use in Witness Extraction.
CAAP 1992: 1-23 |
| 1991 |
|---|
| 5 | | Fabio Alessi,
Franco Barbanera:
Towards a Semantics for the QUEST Language
LICS 1991: 12-21 |
| 4 | | Fabio Alessi,
Franco Barbanera:
Strong Conjunction and Intersection Types.
MFCS 1991: 64-73 |
| 3 | | Franco Barbanera,
Mariangiola Dezani-Ciancaglini:
Intersection and Union Types.
TACS 1991: 651-674 |
| 1990 |
|---|
| 2 | | Franco Barbanera:
Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved.
CTRS 1990: 260-271 |
| 1 | | Franco Barbanera:
Combining Term Rewriting and Type Assignment Systems.
Int. J. Found. Comput. Sci. 1(3): 165-184 (1990) |
