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

Joseph L. Bates

dblp:26/1764 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none

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

Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 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 · 87% Automated reasoning and model checking · 13%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Requirements engineering and software design · 50%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
constructive program development
0.011985
Proofs as Programs · ACM Trans. Program. Lang. Syst. 1985
Programming languages and type systems › type theory
proofs-as-programs
0.011985
Proofs as Programs · ACM Trans. Program. Lang. Syst. 1985
Logic in computer science › philosophical logic › non-classical logic
constructive logic
0.011985
Proofs as Programs · ACM Trans. Program. Lang. Syst. 1985
Logic in computer science › constructive mathematics
proofs-as-programs
0.011985
Proofs as Programs · ACM Trans. Program. Lang. Syst. 1985
Automated reasoning and model checking › theorem proving
interactive theorem proving
0.011985
Proofs as Programs · ACM Trans. Program. Lang. Syst. 1985

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

formal proof · 0.0constructive logic · 0.0
YearPublicationVenuePosition
1985 Writing Programs that Construct Proofs
Robert L. Constable, Todd B. Knoblock, Joseph L. Bates
J. Autom. Reason.3
1985 Proofs as Programs
abstract
The significant intellectual cost of programming is for problem solving and explaining, not for coding. Yet programming systems offer mechanical assistance for the coding process exclusively. We illustrate the use of an implemented program development system, called PRL ("pearl"), that provides automated assistance with the difficult part. The problem and its explained solution are seen as formal objects in a constructive logic of the data domains. These formal explanations can be executed at various stages of completion. The most incomplete explanations resemble applicative programs, the most complete are formal proofs.
Joseph L. Bates, Robert L. Constable
ACM Trans. Program. Lang. Syst.1