| 2006 |
|---|
| 32 | EE | Fabio Mancinelli,
Jaap Boender,
Roberto Di Cosmo,
Jerome Vouillon,
Berke Durak,
Xavier Leroy,
Ralf Treinen:
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions.
ASE 2006: 199-208 |
| 31 | EE | Roberto Di Cosmo:
Educating the e-citizen.
ITiCSE 2006: 1 |
| 30 | EE | Marcelo P. Fiore,
Roberto Di Cosmo,
Vincent Balat:
Remarks on isomorphisms in typed lambda calculi with empty and sum types.
Ann. Pure Appl. Logic 141(1-2): 35-50 (2006) |
| 29 | EE | F. Clément,
V. Martin,
A. Vodicka,
Roberto Di Cosmo,
P. Weis:
Domain decomposition and skeleton programming with OCamlP3l.
Parallel Computing 32(7-8): 539-550 (2006) |
| 2005 |
|---|
| 28 | | F. Clément,
V. Martin,
A. Vodicka,
Roberto Di Cosmo,
P. Weis:
Domain Decomposition and Skeleton Programming with OCamlP3l.
PARCO 2005: 811-818 |
| 27 | EE | Roberto Di Cosmo,
François Pottier,
Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products.
TLCA 2005: 179-193 |
| 2004 |
|---|
| 26 | EE | Roberto Di Cosmo,
Thomas Dufour:
The Equational Theory of < N, 0, 1, +, ×, uparrow > Is Decidable, but Not Finitely Axiomatisable.
LPAR 2004: 240-256 |
| 25 | EE | Vincent Balat,
Roberto Di Cosmo,
Marcelo P. Fiore:
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums.
POPL 2004: 64-76 |
| 2003 |
|---|
| 24 | | Roberto Di Cosmo,
Delia Kesner,
Emmanuel Polonovski:
Proof Nets And Explicit Substitutions.
Mathematical Structures in Computer Science 13(3): 409-450 (2003) |
| 23 | EE | Roberto Di Cosmo,
Susanna Pelagatti:
A Calculus for Dense Array Distributions.
Parallel Processing Letters 13(3): 377-388 (2003) |
| 2002 |
|---|
| 22 | EE | Marcelo P. Fiore,
Roberto Di Cosmo,
Vincent Balat:
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types.
LICS 2002: 147- |
| 2000 |
|---|
| 21 | EE | Roberto Di Cosmo,
Delia Kesner,
Emmanuel Polonovski:
Proof Nets and Explicit Substitutions.
FoSSaCS 2000: 63-81 |
| 20 | EE | Jean-Vincent Loddo,
Roberto Di Cosmo:
Playing Logic Programs with the Alpha-Beta Algorithm.
LPAR 2000: 207-224 |
| 1999 |
|---|
| 19 | | Vincent Balat,
Roberto Di Cosmo:
A Linear Logical View of Linear Type Isomorphisms.
CSL 1999: 250-265 |
| 18 | EE | Roberto Di Cosmo,
Stefano Guerrini:
Strong Normalization of Proof Nets Modulo Structural Congruences.
RTA 1999: 75-89 |
| 1998 |
|---|
| 17 | EE | Roberto Di Cosmo,
Jean-Vincent Loddo,
Stephane Nicolet:
A Game Semantics Foundation for Logic Programming (Extended Abstract).
PLILP/ALP 1998: 355-373 |
| 1997 |
|---|
| 16 | | Roberto Di Cosmo,
Neil Ghani:
On Modular Properties of Higher Order Extensional Lambda Calculi.
ICALP 1997: 237-247 |
| 15 | EE | Roberto Di Cosmo,
Delia Kesner:
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract).
LICS 1997: 35-46 |
| 1996 |
|---|
| 14 | | Maria Virginia Aponte,
Roberto Di Cosmo:
Type Isomorphisms for Module Signatures.
PLILP 1996: 334-346 |
| 13 | | Roberto Di Cosmo:
On the Power of Simple Diagrams.
RTA 1996: 200-214 |
| 12 | | Pierre-Louis Curien,
Roberto Di Cosmo:
A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object.
J. Funct. Program. 6(2): 299-327 (1996) |
| 11 | EE | Roberto Di Cosmo,
Delia Kesner:
Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints.
Theor. Comput. Sci. 169(2): 201-220 (1996) |
| 1995 |
|---|
| 10 | | Roberto Di Cosmo,
Delia Kesner:
Rewriting with Extensional Polymorphic Lambda-Calculus.
CSL 1995: 215-232 |
| 9 | | Roberto Di Cosmo,
Adolfo Piperno:
Expanding Extensional Polymorphism.
TLCA 1995: 139-153 |
| 8 | | Roberto Di Cosmo:
Second Order Isomorphic Types: A Proof Theoretic Study on Second Order lambda-Calculus with Surjective Paring and Terminal Object
Inf. Comput. 119(2): 176-201 (1995) |
| 1994 |
|---|
| 7 | | Roberto Di Cosmo,
Delia Kesner:
Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi.
ICALP 1994: 462-472 |
| 6 | | Roberto Di Cosmo,
Delia Kesner:
Simulating Expansions without Expansions.
Mathematical Structures in Computer Science 4(3): 315-362 (1994) |
| 1993 |
|---|
| 5 | | Roberto Di Cosmo,
Delia Kesner:
A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object.
ICALP 1993: 645-656 |
| 4 | | Roberto Di Cosmo:
Deciding Type Isomorphisms in a Type-Assignment Framework.
J. Funct. Program. 3(4): 485-525 (1993) |
| 1992 |
|---|
| 3 | | Roberto Di Cosmo:
Type Isomorphisms in a Type-Assignment Framework.
POPL 1992: 200-210 |
| 2 | | Kim B. Bruce,
Roberto Di Cosmo,
Giuseppe Longo:
Provable Isomorphisms of Types.
Mathematical Structures in Computer Science 2(2): 231-247 (1992) |
| 1991 |
|---|
| 1 | | Pierre-Louis Curien,
Roberto Di Cosmo:
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object.
ICALP 1991: 291-302 |
