#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1991

2017

- This year (3)
- Last 5 years (26)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Fabio Mancinelli, Jaap Boender, +4 authors Ralf Treinen
- 21st IEEE/ACM International Conference on…
- 2006

The widespread adoption of free and open source software (FOSS) in many strategic contexts of the information technology society has drawn the attention on the issues regarding how to handle the complexity of assembling and managing a huge number of (packaged) components in a consistent and effective way. FOSS distributions (and in particular… (More)

- Kim B. Bruce, Roberto Di Cosmo, Giuseppe Longo
- Mathematical Structures in Computer Science
- 1992

A constructive characterization is given of the isomorphisms which must hold in all models of the typed lambda calculus with surjective pairing. By the close relation between closed Cartesian categories and models of these calculi, we also produce a characterization of those isomorphisms which hold in all CCC’s. By the correspondence between these calculi… (More)

- Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore
- POPL
- 2004

We present a notion of η-long β-normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in normal form. Based on this development we give the first type-directed partial evaluator that constructs %able to construct normal forms of terms in this calculus.

- Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski
- FoSSaCS
- 2000

We refine the simulation technique introduced in (Di Cosmo and Kesner 1997) to show strong normalization of λ-calculi with explicit substitutions via termination of cut elimination in proof nets (Girard 1987). We first propose a notion of equivalence relation for proof nets that extends the one in (Di Cosmo and Guerrini 1999), and we show that cut… (More)

- Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat
- LICS
- 2002

Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question for the language of arithmetic expressions using a constant for the number one and the operations of product and exponentiation is affirmative, and the complete equational theory… (More)

- Roberto Di Cosmo, Michael Lienhardt, +4 authors Alexis Agahi
- ASE
- 2014

Complex networked applications are assembled by connecting software components distributed across multiple machines. Building and deploying such systems is a challenging problem which requires a significant amount of expertise: the system architect must ensure that all component dependencies are satisfied, avoid conflicting components, and add the right… (More)

- Roberto Di Cosmo, François Pottier, Didier Rémy
- TLCA
- 2005

We study subtyping of recursive types in the presence of associative and commutative products—that is, subtyping modulo a restricted form of type isomorphisms. We show that this relation, which we claim is useful in practice, is a composition of the usual subtyping relation with the recently proposed notion of equality up to associativity and commutativity… (More)

- François Clément, Vincent Martin, A. Vodicka, Roberto Di Cosmo, Pierre Weis
- Parallel Computing
- 2005

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior… (More)

- Roberto Di Cosmo, Delia Kesner
- Mathematical Structures in Computer Science
- 1994

We add extensional equalities for the functional and product types to the typed -calculus with not only products and terminal object, but also sums and bounded recursion (a version of recursion that does not allow recursive calls of infinite length). We provide a confluent and strongly normalizing (thus decidable) rewriting system for the calculus, that… (More)

We introduce a semantics of Logic Programming based on classical Game Theory, which is proven to be sound and complete w.r.t. traditional semantics like the minimum Herbrand model and the s-semantics. This AND compositional game semantics allows a very simple characterization of the solution set of a logic program in term of approximations of the value of… (More)