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 Wolman

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

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

Software engineering, systems software and programming languages · 1 · 1 since 2021

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%
Theoretical computer science
1 paper
Logic in computer science · 77% Automata and formal languages · 23%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
language semantics
0.512021
Probabilistic programming semantics for name generation · Proc. ACM Program. Lang. 2021
Programming languages and type systems › language semantics › formal semantics
probabilistic programming semantics
0.512021
Probabilistic programming semantics for name generation · Proc. ACM Program. Lang. 2021
Logic in computer science › semantics
denotational semantics
0.512021
Probabilistic programming semantics for name generation · Proc. ACM Program. Lang. 2021

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

quasi-borel spaces · 1.0descriptive set theory · 1.0
YearPublicationVenuePosition
2021 Probabilistic programming semantics for name generation
abstract
We make a formal analogy between random sampling and fresh name generation. We show that quasi-Borel spaces, a model for probabilistic programming, can soundly interpret the ν-calculus, a calculus for name generation. Moreover, we prove that this semantics is fully abstract up to first-order types. This is surprising for an ‘off-the-shelf’ model, and requires a novel analysis of probability distributions on function spaces. Our tools are diverse and include descriptive set theory and normal forms for the ν-calculus.
Marcin Sabok, Sam Staton, Dario Stein, Michael Wolman
Proc. ACM Program. Lang.4