Person: Pierre Lescanne

DBLP: Lescanne:Pierre

Facilitated 2 volumes:

Ed

Ed

Contributed to:

2004

2001

1999

1996

1995

1994

1992

1992

1990

1990

1990

1987

1986

1985

1984

1983

1983

1987

1989

2018

Wrote 23 papers:

PPDP-2004-DoughertyGL #normalisation

Characterizing strong normalization in a language with control operators (DJD, SG, PL), pp. 155–166.

TLCA-2001-DoughertyL #reduction

Reductions, Intersection Types, and Explicit Substitutions (DJD, PL), pp. 121–135.

FM-v2-1999-LangLL #calculus #framework

A Framework for Defining Object-Calculi (FL, PL, LL), pp. 963–982.

PLILP-1996-BenaissaLR #modelling #recursion #reduction #using

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution (ZEAB, PL, KHR), pp. 393–407.

RTA-1995-LescanneR

Explicit Substitutions with de Bruijn’s Levels (PL, JRD), pp. 294–308.

POPL-1994-Lescanne #calculus

From λσ to λν: a Journey Through Calculi of Explicit Substitutions (PL), pp. 60–69.

ALP-1992-Lescanne #term rewriting #termination

Termination of Rewrite Systems by Elementary Interpretations (PL), pp. 21–36.

CADE-1992-CichonL #algorithm #complexity #polynomial

Polynomial Interpretations and the Complexity of Algorithms (AC, PL), pp. 139–147.

ALP-1990-Lescanne #implementation

Implementations of Completion by Transition Rules + Control: ORME (PL), pp. 262–269.

CADE-1990-Lescanne #implementation #named #set

ORME: An Implementation of Completion Procedures as Sets of Transition Rules (PL), pp. 661–662.

LICS-1990-Lescanne #order

Well Rewrite Orderings (PL), pp. 249–256.

LICS-1987-DauchetTHL #confluence #decidability #term rewriting

Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.

LICS-1987-KirchnerL #equation

Solving Disequations (CK, PL), pp. 347–352.

CADE-1986-CherifaL #implementation #polynomial #term rewriting #termination

An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations (ABC, PL), pp. 42–51.

CADE-1986-GnaedigL #commutative #proving #term rewriting #termination

Proving Termination of Associative Commutative Rewriting Systems by Rewriting (IG, PL), pp. 52–61.

CADE-1986-Lescanne

REVE a Rewrite Rule Laboratory (PL), pp. 695–696.

RTA-1985-RetyKKL #algorithm #logic programming #named #unification

NARROWER: A New Algorithm for Unification and Its Application to Logic Programming (PR, CK, HK, PL), pp. 141–157.

CADE-1984-Lescanne #algebra #term rewriting

Term Rewriting Systems and Algebra (PL), pp. 166–174.

ICALP-1983-LescanneS #case study #data type #on the

On the Study Data Structures: Binary Tournaments with Repeated Keys (PL, JMS), pp. 466–477.

POPL-1983-Lescanne #generative #term rewriting

Computer Experiments with the Reve Term Rewriting System Generator (PL), pp. 99–108.

CAAP-1987-BellegardeL

Transformation Ordering (FB, PL), pp. 69–80.

AS-1989-Lescanne

Completion Procedures as Transition Rules + Control (PL), pp. 28–41.

PPDP-2018-BendkowskiL #combinator

Combinatorics of Explicit Substitutions (MB, PL), p. 12.