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 VLDB 2026 / reviewers in the wild / expert

Mike O'Donnell

dblp:47/303 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1977
—ORCID · none

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

Theory of computation · 1 · 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
1 paper
Logic in computer science · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
rewriting systems		 0.011977
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic · STOC 1977
Programming languages and type systems
functional programming		 0.011977
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic · STOC 1977
Programming languages and type systems › functional programming
lisp		 0.011977
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic · STOC 1977
Logic in computer science › formal systems
combinatory logic		 0.011977
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic · STOC 1977
YearPublicationVenuePosition
1977 Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic
abstract
Recent work on computation of functions defined by sets of recursive equations by Cadiou [Ca72], Vuillemin [Vu74] and Downey and Sethi [DS76] depends on semantic interpretations of such equations. A purely syntactic, combinatory approach yields similar results for a much wider class of sets of equations, including sets of defining equations for LISP, Lucid and the combinator calculus. The application to LISP proves several conjectures of Henderson and Morris [HM76].
Mike O'Donnell
 STOC1