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

P. Mulry

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

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

Theory of computation · 2

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
2 papers
Logic in computer science · 96% Computational complexity · 4%
Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
domain theory
0.021992
Extensional PERs · Inf. Comput. 1992
Extensional PERs · LICS 1990
Logic in computer science › domain theory
partial equivalence relations
0.021992
Extensional PERs · Inf. Comput. 1992
Extensional PERs · LICS 1990
Programming languages and type systems
language semantics
0.011992
Extensional PERs · Inf. Comput. 1992
Logic in computer science › constructive mathematics
realizability
0.011992
Extensional PERs · Inf. Comput. 1992
Programming languages and type systems › type theory
cartesian closed categories
0.011990
Extensional PERs · LICS 1990
Programming languages and type systems
type theory
0.011990
Extensional PERs · LICS 1990
Logic in computer science › categorical semantics
cartesian closed categories
0.011992
Extensional PERs · Inf. Comput. 1992
Logic in computer science
category theory
0.011992
Extensional PERs · Inf. Comput. 1992
Computational complexity › query complexity
lifting theorems
0.011990
Extensional PERs · LICS 1990

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

domain equations · 0.0category theory · 0.0
YearPublicationVenuePosition
1992 Extensional PERs
abstract
A class of Partial Equivalence Relations (PERs) is described such that the resulting full subcategory of the realizability universe has the expected properties of a good category of CPOs; that is, it is a Cartesian closed category and every endomorphism has a canonical fixed point. Moreover, the reflection functor into the subcategory of strict maps (usually called the “lifting operation”) yields a good notion of “partial map,” a necessary condition if one wishes to maintain a connection between strict maps and partial maps. It is shown that all functors that arise in practice have canonical invariant objects; hence a host of domain equations are guaranteed to have solutions.
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott
Inf. Comput.2
1990 Extensional PERs
abstract
A search is conducted for a class of PERs (partial equivalence relations on the natural numbers) such that the resulting full subcategory has the expected properties of any good category of CPOs: it should be a CCC (Cartesian closed category) and every endomorphism should have a canonical fixed point. Moreover the reflection functor (usually called the lifting operation) should yield a good notion of partial map. The following topics are discussed: conventions, partial-map classifiers, ExPERS, ExPERS as domains, reflectivity of strict maps, multicorreflectivity of strict maps, the extensional natural numbers, domain equations, and intrinsic descriptions.>
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott
LICS2