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

Christine Ernoult

dblp:33/4468 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-authorTheory 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.

Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
static analysis		 0.011991
Uniform Ideals and Strictness Analysis · ICALP 1991
Program analysis › static analysis › abstract interpretation
strictness analysis		 0.011991
Uniform Ideals and Strictness Analysis · ICALP 1991
Logic in computer science
domain theory		 0.011991
Uniform Ideals and Strictness Analysis · ICALP 1991
YearPublicationVenuePosition
1995 Untyped Strictness Analysis
abstract
Abstract We re-express Hudak and Young's higher-order strictness analysis for the untyped λ-calculus in a conceptually simpler and more semantically-based manner. We show our analysis to be a sound abstraction of Hudak and Young's which is also complete in a sense we make precise.
Christine Ernoult, Alan Mycroft
 J. Funct. Program.1
1991 Uniform Ideals and Strictness Analysis
Christine Ernoult, Alan Mycroft
 ICALP1