#### Filter Results:

#### Publication Year

1991

2009

#### Co-author

#### Key Phrase

Learn More

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)

- Stefano Guerrini, Simone Martini, Andrea Masini
- 1997

We apply the 2-sequents approach to the analysis of several logics derived from linear logic. In particular, we present a uniform formal system for Linear Logic, Elementary Linear Logic and Light Linear Logic.

- Luca Cardelli, Simone Martini, John C Mitchell, Andre Scedrov
- 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)

- ‹
- 1
- ›