# Reduction strategy (code optimization)

## Papers overview

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

Highly Cited

2007

Highly Cited

2007

- ICFP
- 2007

In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a veryâ€¦Â (More)

Is this relevant?

2007

2007

- Electr. Notes Theor. Comput. Sci.
- 2007

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization ofâ€¦Â (More)

Is this relevant?

2006

2006

- CiE
- 2006

We de ne a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposedâ€¦Â (More)

Is this relevant?

2006

2006

- PPDP
- 2006

We define BASS, a typed boxed ambients calculus with safe sessions. Sessions offer the possibility of using the same channel toâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Inf. Comput.
- 2006

Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may beâ€¦Â (More)

Is this relevant?

2005

2005

- Processes, Terms and Cycles
- 2005

Machine translation // Î»Ïƒ-calculus interpretation // Î»-calculus Formally, the Î»Ïƒ-calculus contains two classes of objects: termsâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

The evaluation function of a reduction semantics (i.e., a small-step operational semantics with an explicit representation of theâ€¦Â (More)

Is this relevant?

1997

1997

1997

- POPL
- 1997

The following theorem of Huet and LÃ©vy forms the basis of all results on optimal reduction strategies for orthogonal termâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- 1995

The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamicâ€¦Â (More)

Is this relevant?