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

Michael R. Wilk

dblp:15/5367 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—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-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
Automated reasoning and model checking · 50% Logic in computer science · 50%
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
Automated reasoning and model checking
constraint solving
0.011991
Equate: An Object-Oriented Constraint Solver · OOPSLA 1991
Logic in computer science
logic programming
0.011991
Equate: An Object-Oriented Constraint Solver · OOPSLA 1991
Programming languages and type systems › object-oriented programming
encapsulation
0.011991
Equate: An Object-Oriented Constraint Solver · OOPSLA 1991
Programming languages and type systems
object-oriented programming
0.011991
Equate: An Object-Oriented Constraint Solver · OOPSLA 1991

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

definite-clause backward chaining · 0.0
YearPublicationVenuePosition
1991 Equate: An Object-Oriented Constraint Solver
abstract
This paper presents a constraint-solving method that obeys the principle of object encapsulation.Under this method, constraints are translated into procedures for achieving constraint satisfaction.Neither the constraints nor their procedural translations refer directly to an object's implementation; all object references are through the interfaces provided by classes.Translation is performed using definite-clause backward chaining, a technique borrowed from logic programming.Because object classes guide the translation process, the method is applicable to objects of all data types.'Examples in this paper are presented without reference to a specific programming language.A working version of Equate is implemented in the Common Lisp Object System.
Michael R. Wilk
OOPSLA1