#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1984

2017

- This year (1)
- Last five years (13)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
- Inf. Comput.
- 1991

System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F <: (pronounced ef-sub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of F <: , which is related to PER models and the notion of… (More)

- Paolo Coppola, Simone Martini
- TLCA
- 2001

The usual (e.g. Prawitz's) treatment of natural deduction for modal logics involves a complicated rule for the introduction of the necessity, since the naive one does not allow nor-malization. We propose natural deduction systems for the positive fragments of the modal logics K, K4, KT, and S4, extending previous work by Masini on a two-dimensional… (More)

- Ugo Dal Lago, Simone Martini
- Theor. Comput. Sci.
- 2008

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus can simulate each other within a polynomial time overhead. The model only relies on combinatorial properties of usual beta-reduction, without any reference to a… (More)

- Andrea Asperti, Simone Martini
- Inf. Comput.
- 1992

- Fabrizio Montarsi, Simone Martini, +10 authors Gioia Capelli
- Parasites & Vectors
- 2013

The container breeding species belonging to the genus Aedes (Meigen) are frequently recorded out of their place of origin. Invasive Aedes species are proven or potential vectors of important Arboviruses and their establishment in new areas pose a threat for human and animal health. A new species of exotic mosquito was recorded in 2011 in north-eastern… (More)

- Ugo Dal Lago, Simone Martini
- Logical Methods in Computer Science
- 2009

We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In particular, weak call-by-value beta-reduction can be simulated by an orthogonal constructor term rewrite system in the same… (More)

- Paolo Mancarella, Simone Martini, Dino Pedreschi
- J. Log. Program.
- 1988

- Andrea Asperti, Simone Martini
- ICLP
- 1989