#### Filter Results:

- Full text PDF available (30)

#### Publication Year

1995

2018

- This year (3)
- Last 5 years (9)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andrea Asperti, Luca Roversi
- ACM Trans. Comput. Log.
- 2002

This article is a structured introduction to Intuitionistic Light Affine Logic (ILAL). ILAL has a polynomially costing normalization, and it is expressive enough to encode, and simulate, all PolyTime… (More)

- Luca Roversi, Luca Vercelli
- TYPES
- 2008

We introduce a multimodal stratified framework MS that generalizes an idea hidden in the definitions of Light Linear/Affine logical systems: “More modalities means more expressiveness”. MS is a set… (More)

In this work we present a categorical approach for modeling the pure (i.e., without constants) call-by-value -calculus, defined by Plotkin as a restriction of the classical one. In particular, we… (More)

- Luca Roversi
- ArXiv
- 2012

It is well known that we can use structural proof theory to refine, or generalize, existing paradigmatic computational primitives, or to discover new ones. Under such a point of view we keep… (More)

- Amerigo Santoro, Alessandra Majorana, +6 authors Fabio F. Facchetti
- The Journal of pathology
- 2005

Using immunohistochemistry the presence of different dendritic cell (DC) subsets was analysed in 16 biopsies from patients with oral lichen planus (OLP). A significant increase of CD1a+/Langerin+… (More)

- Luca Roversi
- CSL
- 1999

We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.

The intersection type assignment system IT uses the formulas of the negative fragment of the predicate calculus (LJ) as types for the λ-terms. However, the deductions of IT only correspond to the… (More)

- Luca Paolini, Mauro Piccolo, Luca Roversi
- Electr. Notes Theor. Comput. Sci.
- 2016

Reversible computing is bi-deterministic which means that its execution is both forward and backward deterministic, i.e. next/previous computational step is uniquely determined. Various approaches… (More)

The goal of this work is to present a proof-theoretical justification for IT. In particular, we discuss the relationship between the intersection connective and the intuitionistic conjunction. For… (More)

- Simona Ronchi Della Rocca, Luca Roversi
- Studia Logica
- 1997

The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomorphism, the intuitionistic proof of a formula can be seen as a functional program, whose type is the… (More)