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

Helen Lowe

dblp:32/4868 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Theory of computation · 4 · 2 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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
Programming languages and type systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
functional programming		 0.011999
An ML Editor Based on Proofs-As-Programs · ASE 1999
Programming languages and type systems › functional language
ML		 0.011999
An ML Editor Based on Proofs-As-Programs · ASE 1999
Programming languages and type systems › type theory
proofs-as-programs		 0.011999
An ML Editor Based on Proofs-As-Programs · ASE 1999
Computing education › programming education
programming language learning		 0.011999
An ML Editor Based on Proofs-As-Programs · ASE 1999

Methods — techniques the papers use, named apart from their topics

termination analysis · 0.0proof representation · 0.0
YearPublicationVenuePosition
2000 System Description: Interactive Proof Critics in XBarnacle
Mike Jackson 0003, Helen Lowe
 CADE2
1999 System Description: CyNTHIA
Jon Whittle 0001, Alan Bundy, Richard J. Boulton, Helen Lowe
 CADE4
1999 An ML Editor Based on Proofs-As-Programs
abstract
C/sup Y/NTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of C/sup Y/NTHIA edit programs by applying sequences of high-level editing commands to existing programs. These commands make changes to the proof representation from which a new program is then extracted. The use of proofs is a sound framework for analysing ML programs and giving useful feedback about errors. Amongst the properties analysed within C/sup Y/NTHIA at present is termination. C/sup Y/NTHIA has been successfully used in the teaching of ML in two courses at Napier University, Scotland. C/sup Y/NTHIA is a convincing, real-world application of the proofs-as-programs idea.
Jon Whittle 0001, Alan Bundy, Richard J. Boulton, Helen Lowe
 ASE4
1998 The Use of Proof Planning for Co-operative Theorem Proving
Helen Lowe, Alan Bundy, Duncan McLean
 J. Symb. Comput.1
1997 XBarnacle: Making Theorem Provers More Accessible
Helen Lowe, David Duncan
 CADE1