In type theory, a type system has the property of subject reduction (also subject evaluation, type preservation or simply preservation) if evaluation… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Vasco Thudichum Vasconcelos, Marco Giunti, Nobuko Yoshida, Kohei Honda, Vladimir Tonello de Vasconcelos, Michele Giunti
- 2010

We present a simple and intuitive type system for a variant of the pi calculus with sessions where typable processes are… (More)

Is this relevant?

2002

2002

- Pierre Deransart, Jan-Georg Smaus
- Journal of Functional and Logic Programming
- 2002

We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it… (More)

Is this relevant?

2000

2000

- Jan-Georg Smaus, François Fages, Pierre Deransart
- FSTTCS
- 2000

We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Andrew D. Gordon, Paul D. Hankin
- Electr. Notes Theor. Comput. Sci.
- 1998

We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli’s imperative object calculus… (More)

Is this relevant?

1997

1997

We define the typed lambda calculus Fω ∧ , a natural generalization of Girard’s system F with intersection types and bounded… (More)

Is this relevant?

1996

1996

- Gilles Barthe, Paul-André Melliès
- CSL
- 1996

Algebraic type systems provide a general framework for the study of the interaction between typed-calculi and typed rewriting… (More)

Is this relevant?

1996

1996

- Roel Bloo, Fairouz Kamareddine, Rob Nederpelt
- Inf. Comput.
- 1996

In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding definition mechanisms. We sho… (More)

Is this relevant?

1995

1995

- Zurab Khasidashvili, Vincent van Oostrom
- Electr. Notes Theor. Comput. Sci.
- 1995

We introduce Context-sensitive Conditional Expression Reduction Systems (CERS) by extending and generalizing the notion of… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Andrew K. Wright, Matthias Felleisen
- Inf. Comput.
- 1994

We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach… (More)

Is this relevant?

1992

1992

- Herman Geuvers
- 1992

In this paper we investigate the Church-Rosser property (CR) for Pure Type Systems with-reduction. For Pure Type Systems with… (More)

Is this relevant?