Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Stéphane Kaplan

dblp:21/5466 · DBLP profile ↗
← Back
15ranked-venue papers
8as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 7 first-authorSoftware engineering, systems software and programming languages · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Logic in computer science · 81% Automata and formal languages · 19%
Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › module systems
module specification		 0.011990
Mixing Abstract and Concrete Modules: Specification, Development and Prototyping · ICSE 1990
Programming languages and type systems
module systems		 0.011990
Mixing Abstract and Concrete Modules: Specification, Development and Prototyping · ICSE 1990
Logic in computer science › term rewriting
infinitary rewriting		 0.011989
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite · POPL 1989
Logic in computer science
lambda calculus		 0.011989
Infinite Normal Forms (Preliminary Version) · ICALP 1989
Automata and formal languages › grammar transformation
normal forms		 0.011989
Infinite Normal Forms (Preliminary Version) · ICALP 1989
Logic in computer science
rewriting systems		 0.011989
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite · POPL 1989
Logic in computer science
term rewriting		 0.011989
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite · POPL 1989
Programming languages and type systems
language semantics		 0.011989
Infinite Normal Forms (Preliminary Version) · ICALP 1989
YearPublicationVenuePosition
1991 Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . .
Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted
 Theor. Comput. Sci.2
1990 Mixing Abstract and Concrete Modules: Specification, Development and Prototyping
Christine Choppy, Stéphane Kaplan
 ICSE2
1989 Infinite Normal Forms (Preliminary Version)
Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted
 ICALP2
1989 Rewrite, Rewrite, Rewrite, Rewrite, Rewrite
abstract
We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit.In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories.We also consider sufficient completeness of hierarchical systems.
Nachum Dershowitz, Stéphane Kaplan
 POPL2
1989 Abstract Rewriting with Concrete Operations
Stéphane Kaplan, Christine Choppy
 RTA1
1989 Complexity Analysis of Term-Rewriting Systems
Christine Choppy, Stéphane Kaplan, Michèle Soria
 Theor. Comput. Sci.2
1988 Algebraic and Operational Semantics of Positive/Negative Conditional Algebraic Specification
Stéphane Kaplan
 FSTTCS1
1988 Positive/Negative Conditional Rewriting
Stéphane Kaplan
 MFCS1
1988 Rewriting with a Nondeterministic Choice Operator
Stéphane Kaplan
 Theor. Comput. Sci.1
1987 Algorithmic Complexity of Term Rewriting Systems
Christine Choppy, Stéphane Kaplan, Michèle Soria
 RTA2
1987 A Compiler for Conditional Term Rewriting Systems
Stéphane Kaplan
 RTA1
1987 Asspegique: An Integrated Specification Environment
Michel Bidoit, Francis Capy, Christine Choppy, M.-A. Choquer, Stéphane Kaplan, Françoise Schlienger, Frédéric Voisin
 STACS5
1987 Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence
Stéphane Kaplan
 J. Symb. Comput.1
1986 Rewriting with a Nondeterministic Choice Operator: From Algebra to Proofs
Stéphane Kaplan
 ESOP1
1984 Conditional Rewrite Rules
Stéphane Kaplan
 Theor. Comput. Sci.1